Is There a Best Büchi Automaton for Explicit Model Checking?

From LRDE

Abstract

LTL to Büchi automata (BA) translators are traditionally optimized to produce automata with a small number of states or a small number of non-deterministic states. In this paper, we search for properties of Büchi automata that really influence the performance of explicit model checkers. We do that by manual analysis of several automata and by experiments with common LTL-to-BA translators and realistic verification tasks. As a result of these experiences, we gain a better insight into the characteristics of automata that work well with Spin.

Documents

Bibtex (lrde.bib)

@InProceedings{	  blahoudek.14.spin,
  author	= {Franti\v{s}ek Blahoudek and Alexandre Duret-Lutz and
		  Mojm\'{i}r K\v{r}et\'{i}nsk\'{y} and Jan Strej\v{c}ek},
  title		= {Is There a Best {B\"u}chi Automaton for Explicit Model
		  Checking?},
  booktitle	= {Proceedings of the 21th International SPIN Symposium on
		  Model Checking of Software (SPIN'14)},
  year		= 2014,
  pages		= {68--76},
  publisher	= {ACM},
  abstract	= { LTL to B\"uchi automata (BA) translators are
		  traditionally optimized to produce automata with a small
		  number of states or a small number of non-deterministic
		  states. In this paper, we search for properties of B\"uchi
		  automata that really influence the performance of explicit
		  model checkers. We do that by manual analysis of several
		  automata and by experiments with common LTL-to-BA
		  translators and realistic verification tasks. As a result
		  of these experiences, we gain a better insight into the
		  characteristics of automata that work well with Spin. },
  doi		= {10.1145/2632362.2632377}
}