Skip to Main content Skip to Navigation
Journal articles

Model Checking using Generalized Testing Automata

Abstract : 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. In previous work, we compared TA against Transition-based Generalized Büchi Automata (TGBA), and concluded that TA were more interesting when counterexamples were expected, otherwise TGBA were more efficient. In this work we introduce a new kind of automata, dubbed Transition-based Generalized Testing Automata (TGTA), that combine ideas from TA and TGBA. Implementation and experimentation of TGTA show that they outperform other approaches in most of the cases.
Document type :
Journal articles
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Ala Eddine Ben Salem Connect in order to contact the contributor
Submitted on : Friday, August 30, 2013 - 11:55:40 AM
Last modification on : Sunday, June 26, 2022 - 9:48:01 AM
Long-term archiving on: : Thursday, April 6, 2017 - 10:50:54 AM


Files produced by the author(s)



Ala Eddine Ben Salem, Alexandre Duret-Lutz, Fabrice Kordon. Model Checking using Generalized Testing Automata. LNCS Transactions on Petri Nets and Other Models of Concurrency, Springer, 2012, 7400 (VI), pp.94-122. ⟨10.1007/978-3-642-35179-2_5⟩. ⟨hal-00855991⟩



Record views


Files downloads