5 citations · 5 across the 4 of their papers we have counts for
4 papers
Simplifying LTL Model Checking Given Prior Knowledge
Alexandre Duret-Lutz, Denis Poitrenaud, Yann Thierry-Mieg
We consider the problem of the verification of an LTL specification on a system given some prior knowledge , an LTL formula that is known to satisfy. The automata-th…
Structural Reductions and Stutter Sensitive Properties
Emmanuel Paviot-Adet, Denis Poitrenaud, Etienne Renault +1
Verification of properties expressed as -regular languages such as LTL can benefit hugely from stutter insensitivity, using a diverse set of reduction strategies. However proper…
LTL under reductions with weaker conditions than stutter-invariance
Emmanuel Paviot-Adet, Denis Poitrenaud, Etienne Renault +1
Verification of properties expressed as-regular languages such as LTL can benefit hugely from stutter-insensitivity, using a diverse set of reduction strategies. However properties…
Combining Explicit and Symbolic Approaches for Better On-the-Fly LTL Model Checking
Alexandre Duret-Lutz, Kais Klai, Denis Poitrenaud +1
We present two new hybrid techniques that replace the synchronized product used in the automata-theoretic approach for LTL model checking. The proposed products are explicit graphs…