Skip to Main content Skip to Navigation
Conference papers

{Generalized Büchi Automata versus Testing Automata for Model Checking}

Ala Eddine Ben Salem 1 Alexandre Duret-Lutz Fabrice Kordon 1 
1 MoVe - Modélisation et Vérification
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Geldenhuys and Hansen have shown that a kind of ω-automaton known as testing automata can outperform the Büchi automata traditionally used in the automata-theoretic approach to model checking [8]. This work completes their experiments by including a comparison with generalized Büchi automata; by using larger state spaces derived from Petri nets; and by distinguishing violated formulæ (for which testing automata fare better) from verified formulæ (where testing automata are hindered by their two-pass emptiness check).
Document type :
Conference papers
Complete list of metadata
Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Thursday, March 3, 2016 - 5:08:12 PM
Last modification on : Sunday, June 26, 2022 - 9:41:28 AM


  • HAL Id : hal-01282490, version 1


Ala Eddine Ben Salem, Alexandre Duret-Lutz, Fabrice Kordon. {Generalized Büchi Automata versus Testing Automata for Model Checking}. 2nd workshop on Scalable and Usable Model Checking for Petri Nets and other models of Concurrency (SUMo 2011), Jun 2011, Newcastle, United Kingdom. pp.65-79. ⟨hal-01282490⟩



Record views