We show how deterministic Büchi automata can be fully minimised by reduction to the satisfiability (SAT) problem, yielding the first automated method for this task. Size reduction of such ω-automata is an important step in probabilistic model checking as well as synthesis of finite-state systems. Our experiments demonstrate that state-of-the-art SAT solvers are capable of solving the resulting satisfiability problem instances quickly, making the approach presented valuable in practice. © 2010 Springer-Verlag.
CITATION STYLE
Ehlers, R. (2010). Minimising deterministic Büchi automata precisely using SAT solving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6175 LNCS, pp. 326–332). https://doi.org/10.1007/978-3-642-14186-7_28
Mendeley helps you to discover research relevant for your work.