Learn with SAT to Minimize Büchi Automata

We describe a minimization procedure for nondeterministic Büchi automata (NBA). For an automaton A another automaton A_min with the minimal number of states is learned with the help of a SAT-solver. This is done by successively computing automata A' that approximate A in the sense that they acc...

Full description

Bibliographic Details
Main Authors: Stephan Barth, Martin Hofmann
Format: Article
Language:English
Published: Open Publishing Association 2012-10-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1210.2452v1