Model Checking using Generalized Testing Automata - Archive ouverte HAL Access content directly
Journal Articles LNCS Transactions on Petri Nets and Other Models of Concurrency Year : 2012

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.
Fichier principal
Vignette du fichier
ToPNoC-2012.pdf (779.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00855991 , version 1 (30-08-2013)

Identifiers

Cite

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, 2012, 7400 (VI), pp.94-122. ⟨10.1007/978-3-642-35179-2_5⟩. ⟨hal-00855991⟩
98 View
94 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More