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 language | English |
---|---|
Title of host publication | Computer Aided Verification |
Subtitle of host publication | 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I |
Editors | Daniel Kroening, Corina S. Păsăreanu |
Publisher | Springer |
Pages | 479-486 |
Volume | 9206 LNCS |
ISBN (Electronic) | 9783319216904 |
ISBN (Print) | 9783319216898 |
DOIs | |
Publication status | Published - 16 Jul 2015 |
Event | 27th International Conference, Computer Aided Verification - San Francisco, United States Duration: 18 Jul 2015 → 24 Jul 2015 |
Conference
Conference | 27th International Conference, Computer Aided Verification |
---|---|
Country/Territory | United States |
City | San Francisco |
Period | 18/07/15 → 24/07/15 |