The Hanoi Omega-Automata Format

Tomas Babiak, Frantisek Blahoudek, Alexandre Duret-Lutz, Joachim Klein, Jan Kretinsky, David Muller, David Parker, Jan Strejcek

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

39 Citations (Scopus)
215 Downloads (Pure)

Abstract

We propose a flexible exchange format for ω-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.
Original languageEnglish
Title of host publicationComputer Aided Verification
Subtitle of host publication27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I
EditorsDaniel Kroening, Corina S. Păsăreanu
PublisherSpringer
Pages479-486
Volume9206 LNCS
ISBN (Electronic)9783319216904
ISBN (Print)9783319216898
DOIs
Publication statusPublished - 16 Jul 2015
Event27th International Conference, Computer Aided Verification - San Francisco, United States
Duration: 18 Jul 201524 Jul 2015

Conference

Conference27th International Conference, Computer Aided Verification
Country/TerritoryUnited States
CitySan Francisco
Period18/07/1524/07/15

Fingerprint

Dive into the research topics of 'The Hanoi Omega-Automata Format'. Together they form a unique fingerprint.

Cite this