{Generalized Büchi Automata versus Testing Automata for Model Checking} - Université Pierre et Marie Curie Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

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

Ala Eddine Ben Salem
  • Fonction : Auteur
  • PersonId : 971718
Alexandre Duret-Lutz
Fabrice Kordon

Résumé

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).
Fichier non déposé

Dates et versions

hal-01282490 , version 1 (03-03-2016)

Identifiants

  • HAL Id : hal-01282490 , version 1

Citer

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⟩
184 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More