Mechanizing the Minimization of Deterministic Generalized Büchi Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Mechanizing the Minimization of Deterministic Generalized Büchi Automata

Abstract

Deterministic Büchi automata (DBA) are useful to (probabilistic) model checking and synthesis. We survey techniques used to obtain and minimize DBAs for different classes of properties. We extend these techniques to support DBA that have generalized and transition-based acceptance (DTGBA) as they can be even smaller. Our minimization technique - a reduction to a SAT problem - synthesizes a DTGBA equivalent to the input DTGBA for any given number of states and number of acceptance sets (assuming such automaton exists). We present benchmarks using a framework that implements all these techniques.
Fichier principal
Vignette du fichier
978-3-662-43613-4_17_Chapter.pdf (411.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01215522 , version 1 (22-11-2016)

Licence

Attribution

Identifiers

Cite

Souheib Baarir, Alexandre Duret-Lutz. Mechanizing the Minimization of Deterministic Generalized Büchi Automata. 34th Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2014, Berlin, Germany. pp.266-283, ⟨10.1007/978-3-662-43613-4_17⟩. ⟨hal-01215522⟩
200 View
134 Download

Altmetric

Share

Gmail Facebook X LinkedIn More