#### Filter Results:

#### Publication Year

2012

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Geldenhuys and Hansen showed that a kind of ω-automata known as Testing Automata (TA) can, in the case of stuttering-insensitive properties, out-perform 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… (More)

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… (More)

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… (More)

An alternative to the traditional Büchi Automata (BA), called Testing Automata (TA) was proposed by Hansen et al. [8, 6] to improve the automata-theoretic 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… (More)

—In automata-theoretic model checking, there are mainly two approaches: explicit and symbolic. In the explicit approach [1], the state-space is constructed explicitly and lazily during exploration (i.e., on-the-fly). The symbolic approach [2] tries to overcome the state-space explosion obstacle by symbolically encoding the state-space in a concise way using… (More)

- ‹
- 1
- ›