Complementation of TBA Based on Semi-Determinization – Bc. Mikuláš Klokočka
Bc. Mikuláš Klokočka
Master's thesis
Complementation of TBA Based on Semi-Determinization
Complementation of TBA Based on Semi-Determinization
Abstract:
Tato diplomová práce se věnuje tématu komplementace Büchiho automatů. V první řadě ukazuje již existující metody komplementace. Práce poté definuje nový algoritmus pro komplementaci nazvaný PBS. Dále uvadí řadu optimalizací tohoto algoritmu. Součástí této práce je taktéž jeho implementace. PBS je porovnáno s několika moderními nástroji pro komplementaci. Výsledky tohoto porovnání svědčí o tom, že je …moreAbstract:
This thesis deals with the topic of complementation of Büchi automata. First, it shows a brief overview of the existing methods for complementation. Then it defines a new algorithm for complementation called PBS. It also covers a number of optimizations for this algorithm. Part of this thesis is also the implementation of PBS. PBS was compared to state-of-the-art tools for complementation. The results …more
Language used: English
Date on which the thesis was submitted / produced: 20. 5. 2019
Identifier:
https://is.muni.cz/th/y3sx3/
Thesis defence
- Date of defence: 20. 6. 2019
- Supervisor: doc. RNDr. Jan Strejček, Ph.D.
- Reader: RNDr. Vojtěch Řehák, Ph.D.
Citation record
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsMaster programme / field:
Informatics / Theoretical Informatics
Theses on a related topic
-
Transformation of Nondeterministic Büchi Automata to Slim Automata
Pavel Šimovec -
Transformation of Nondeterministic Büchi Automata to Tight Automata
Marek Jankola -
Translation of LTL to Semi-Deterministic Automata via Alternating Automata
Michal Románek -
Mapping the Omega-Automata Jungle
Tomáš Macháček -
Simple Complementation of Generalized Büchi Automata
David Dokoupil -
Counter Automata for MTL over Untimed Words
Tereza Kinská -
QBF-Based Simplification of Acceptance Condition of Emerson-Lei Automata
Tereza Schwarzová