Symbolic Model Checking of Stutter-Invariant Properties Using Generalized Testing Automata
نویسندگان
چکیده
In a previous work, we showed that a kind of ω-automata known as Transition-based Generalized Testing Automata (TGTA) can outperform the Büchi automata traditionally used for explicit model checking when verifying stutter-invariant properties. In this work, we investigate the use of these generalized testing automata to improve symbolic model checking of stutter-invariant LTL properties. We propose an efficient symbolic encoding of stuttering transitions in the product between a model and a TGTA. Saturation techniques available for decision diagrams then benefit from the presence of stuttering self-loops on all states of TGTA. Experimentation of this approach confirms that it outperforms the symbolic approach based on (transition-based) Generalized Büchi Automata.
منابع مشابه
Extending Testing Automata to All LTL
An alternative to the traditional Büchi Automata (BA), called Testing Automata (TA) was proposed by Hansen et al. [8, 6] to improve the automatatheoretic approach to LTL model checking. In previous work [2], we proposed an improvement of this alternative approach called TGTA (Generalized Testing Automata). TGTA mixes features from both TA and TGBA (Generalized Büchi Automata), without the disad...
متن کاملSingle-Pass Testing Automata for LTL Model Checking
Testing Automaton (TA) is a new kind of ω-automaton introduced by Hansen et al. [6] as an alternative to the standard Büchi Automata (BA) for the verification of stutter-invariant LTL properties. Geldenhuys and Hansen [5] shown later how to use TA in the automata-theoretic approach to LTL model checking. They propose a TA-based approach using a verification algorithm that requires two searches ...
متن کاملPractical Stutter-Invariance Checks for ω-Regular Languages
An ω-regular language is stutter-invariant if it is closed by the operation that duplicates some letter in a word or that removes some duplicate letter. Model checkers can use powerful reduction techniques when the specification is stutter-invariant. We propose several automata-based constructions that check whether a specification is stutter-invariant. These constructions assume that a specifi...
متن کاملModel Checking Using Generalized Testing Automata
Geldenhuys and Hansen showed that a kind of ω-automata known as Testing Automata (TA) can, in the case of stuttering-insensitive properties, outperform the Büchi automata traditionally used in the automata-theoretic approach to model checking [10]. In previous work [23], we compared TA against Transition-based Generalized Büchi Automata (TGBA), and concluded that TA were more interesting when c...
متن کاملA Transformation-Based Approach to Implication of GSTE Assertion Graphs
Generalized symbolic trajectory evaluation (GSTE) is a model checking approach and has successfully demonstrated its powerful capacity in formal verification of VLSI systems. GSTE is an extension of symbolic trajectory evaluation (STE) to themodel checking of ω-regular properties. It is an alternative to classical model checking algorithms where properties are specified as finite-state automata...
متن کامل