Name
Abstract | ||
|---|---|---|
Transforming deterministic.-automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this approach, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and find out that our method produces smaller automata than previous approaches. Moreover, the experiments demonstrate the potential of our method for LTL synthesis, using LTL-to-Rabin translators. It leads to significantly smaller parity automata when compared to state-of-the-art approaches on complex formulae. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-662-54577-5_26 | TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2017, PT I |
DocType | Volume | ISSN |
Conference | 10205 | 0302-9743 |
Citations | PageRank | References |
2 | 0.36 | 17 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Kretínský | 1 | 159 | 16.02 |
| Tobias Meggendorfer | 2 | 15 | 3.90 |
| Clara Waldmann | 3 | 2 | 0.36 |
| Maximilian Weininger | 4 | 6 | 1.79 |