Extending Testing Automata to All LTL - Formal Techniques for Distributed Objects, Components, and Systems Access content directly
Conference Papers Year : 2015

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 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 (Generalized Büchi Automata), without the disadvantage of TA, which is the second pass of the emptiness check algorithm. We have shown that TGTA outperform TA, BA and TGBA for explicit and symbolic LTL model checking. However, TA and TGTA are less expressive than Büchi Automata since they are able to represent only stutter-invariant LTL properties (LTL ∖X) [13]. In this paper, we show how to extend Generalized Testing Automata (TGTA) to represent any LTL property. This allows to extend the model checking approach based on this new form of testing automata to check other kinds of properties and also other kinds of models (such as Timed models). Implementation and experimentation of this extended TGTA approach show that it is statistically more efficient than the Büchi Automata approaches (BA and TGBA), for the explicit model checking of LTL properties.
Fichier principal
Vignette du fichier
978-3-319-19195-9_13_Chapter.pdf (1.42 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01767338 , version 1 (16-04-2018)





Ala Salem. Extending Testing Automata to All LTL. 35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2015, Grenoble, France. pp.196-210, ⟨10.1007/978-3-319-19195-9_13⟩. ⟨hal-01767338⟩
72 View
80 Download



Gmail Facebook X LinkedIn More