Name
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 Buchi, 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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-21690-4_31 | COMPUTER AIDED VERIFICATION, PT I |
Field | DocType | Volume |
Programming language,Computer science,Automaton,Algorithm,Theoretical computer science,Omega,True quantified Boolean formula,Probabilistic model checking,Common Power Format,Formal verification | Conference | 9206 |
ISSN | Citations | PageRank |
0302-9743 | 13 | 0.55 |
References | Authors | |
10 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomáš Babiak | 1 | 90 | 3.70 |
| Frantisek Blahoudek | 2 | 48 | 4.02 |
| Alexandre Duret Lutz | 3 | 213 | 17.70 |
| Joachim Klein | 4 | 118 | 9.33 |
| Jan Kretínský | 5 | 159 | 16.02 |
| David Müller | 6 | 22 | 2.39 |
| David Parker | 7 | 4018 | 184.00 |
| Jan Strejcek | 8 | 99 | 13.83 |