The Hanoi Omega-Automata Format

From LRDE

Abstract

We propose a flexible exchange format for Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \omega} -automata, as typically used in formal verification, and implement support for it in a range of established tools. Our aim is to simplify the interaction of tools, helping the research community to build upon other people's work. A key feature of the format is the use of very generic acceptance conditions, specified by Boolean combinations of acceptance primitives, rather than being limited to common cases such as Büchi, Streett, or Rabin. Such flexibility in the choice of acceptance conditions can be exploited in applications, for example in probabilistic model checking, and furthermore encourages the development of acceptance-agnostic tools for automata manipulations. The format allows acceptance conditions that are either state-based or transition-based, and also supports alternating automata.

Documents


Bibtex (lrde.bib)

@InProceedings{	  babiak.15.cav,
  author	= {Tom{\'{a}\v{s}} Babiak and Franti{\v{s}}ek Blahoudek and
		  Alexandre Duret-Lutz and Joachim Klein and Jan K{\v
		  r}et{\'i}nsk{\'{y}} and David M{\"u}ller and David Parker
		  and Jan Strej{\v{c}}ek},
  title		= {The {H}anoi {O}mega-{A}utomata Format},
  booktitle	= {Proceedings of the 27th International Conference on
		  Computer Aided Verification (CAV'15)},
  year		= 2015,
  volume	= {9206},
  series	= {Lecture Notes in Computer Science},
  pages		= {479--486},
  month		= jul,
  publisher	= {Springer},
  abstract	= { We propose a flexible exchange format for
		  $\omega$-automata, as typically used in formal
		  verification, and implement support for it in a range of
		  established tools. Our aim is to simplify the interaction
		  of tools, helping the research community to build upon
		  other people's work. A key feature of the format is the use
		  of very generic acceptance conditions, specified by Boolean
		  combinations of acceptance primitives, rather than being
		  limited to common cases such as B\"uchi, Streett, or Rabin.
		  Such flexibility in the choice of acceptance conditions can
		  be exploited in applications, for example in probabilistic
		  model checking, and furthermore encourages the development
		  of acceptance-agnostic tools for automata manipulations.
		  The format allows acceptance conditions that are either
		  state-based or transition-based, and also supports
		  alternating automata.},
  doi		= {10.1007/978-3-319-21690-4_31}
}