Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization
| Authors | |
|---|---|
| Year of publication | 2020 |
| Type | Article in Proceedings |
| Conference | Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part II |
| MU Faculty or unit | |
| Citation | |
| Web | https://link.springer.com/chapter/10.1007%2F978-3-030-53291-8_2 |
| Doi | http://dx.doi.org/10.1007/978-3-030-53291-8_2 |
| Keywords | semi-determinization; complementation; generalized Büchi automata; Seminator |
| Description | We present the second generation of the tool Seminator that transforms transition-based generalized Büchi automata (TGBAs) into equivalent semi-deterministic automata. The tool has been extended with numerous optimizations and produces considerably smaller automata than its first version. In connection with the state-of-the-art LTL to TGBAs translator Spot, Seminator 2 produces smaller (on average) semi-deterministic automata than the direct LTL to semi-deterministic automata translator ltl2ldgba of the Owl library. Further, Seminator 2 has been extended with an improved NCSB complementation procedure for semi-deterministic automata, providing a new way to complement automata that is competitive with state-of-the-art complementation tools. |
| Related projects: |