Personal tools

Explicit State Model Checking with Generalized Büchi and Rabin Automata

From LRDE

Jump to: navigation, search

Abstract

In the automata theoretic approach to explicit state LTL model checking, the synchronized product of the model and an automaton that represents the negated formula is checked for emptiness. In practice, a (transition-based generalized) Büchi automaton (TGBA) is used for this procedure. This paper investigates whether using a more general form of acceptance, namely transition-based generalized Rabin automata (TGRAs), improves the model checking procedure. TGRAs can have significantly fewer states than TGBAshowever the corresponding emptiness checking procedure is more involved. With recent advances in probabilistic model checking and LTL to TGRA translators, it is only natural to ask whether checking a TGRA directly is more advantageous in practice. We designed a multi-core TGRA checking algorithm and performed experiments on a subset of the models and formulas from the 2015 Model Checking Contest. We observed that our algorithm can be used to replace a TGBA checking algorithm without losing performance. In general, we found little to no improvement by checking TGRAs directly.

Documents

Bibtex (lrde.bib)

@InProceedings{	  bloemen.17.spin,
  author	= {Vincent Bloemen and Alexandre Duret-Lutz and Jaco van de
		  Pol},
  title		= {Explicit State Model Checking with Generalized B{\"u}chi
		  and Rabin Automata},
  booktitle	= {Proceedings of the International SPIN Symposium on Model
		  Checking of Software (SPIN'17)},
  year		= {2017},
  publisher	= {ACM},
  month		= jul,
  note		= {To appear},
  abstract	= {In the automata theoretic approach to explicit state LTL
		  model checking, the synchronized product of the model and
		  an automaton that represents the negated formula is checked
		  for emptiness. In practice, a (transition-based
		  generalized) B\"uchi automaton (TGBA) is used for this
		  procedure.
		  
		  This paper investigates whether using a more general form
		  of acceptance, namely transition-based generalized Rabin
		  automata (TGRAs), improves the model checking procedure.
		  TGRAs can have significantly fewer states than TGBAs,
		  however the corresponding emptiness checking procedure is
		  more involved. With recent advances in probabilistic model
		  checking and LTL to TGRA translators, it is only natural to
		  ask whether checking a TGRA directly is more advantageous
		  in practice.
		  
		  We designed a multi-core TGRA checking algorithm and
		  performed experiments on a subset of the models and
		  formulas from the 2015 Model Checking Contest. We observed
		  that our algorithm can be used to replace a TGBA checking
		  algorithm without losing performance. In general, we found
		  little to no improvement by checking TGRAs directly.}
}