Translation of LTL to Semi-Deterministic Automata via Alternating Automata – Bc. Michal Románek
Bc. Michal Románek
Master's thesis
Translation of LTL to Semi-Deterministic Automata via Alternating Automata
Translation of LTL to Semi-Deterministic Automata via Alternating Automata
Abstract:
Táto práca sa zameriava na preklad LTL formulí na semi-deterministické automaty (SDBA). V práci navrhujem nový spôsob prekladu, používajúc veľmi slabé alternujúce automaty (VWAA) a uvádzam nový preklad z VWAA do SDBA. Výsledkom práce je aj nový nástroj LTL2SDBA, ktorý vykonáva tento preklad a ktorého výsledky porovnávam s existujúcimi nástrojmi.Abstract:
The focus of this thesis is the translation of LTL formulae to semi-deterministic automata (SDBA). We propose a new way of translation via very weak alternating automata (VWAA). We use an existing translation of LTL to VWAA and introduce a new translation of VWAA to SDBA. Finally, we also implement it in a tool called LTL2SDBA and compare the results to existing tools.
Language used: English
Date on which the thesis was submitted / produced: 12. 12. 2018
Identifier:
https://is.muni.cz/th/xq7cw/
Thesis defence
- Date of defence: 4. 2. 2019
- Supervisor: doc. RNDr. Jan Strejček, Ph.D.
- Reader: prof. RNDr. Ivana Černá, CSc.
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:
Applied Informatics / Applied Informatics
Theses on a related topic
-
Translation of LTL to omega-automata
Tomáš Babiak -
Translation of an LTL fragment to deterministic Rabin and Streett automata
František Blahoudek -
Untimed LTL Model Checking of Timed Automata
Jan Havlíček