Automata for Formal Methods: Little Steps Towards Perfection – RNDr. František Blahoudek
RNDr. František Blahoudek
Doctoral thesis
Automata for Formal Methods: Little Steps Towards Perfection
Automata for Formal Methods: Little Steps Towards Perfection
Abstract:
Jako vhodná reprezentace jazyků nekonečných slov jsou ω-automaty hojně využívány ve formálních metodách. Obzvlášťe algoritmy, které analyzují systémy vykazující nekonečné chování, často spoléhají na ω-automaty. Díky efektivním algoritmům pro průnik, sjednocení a test prázdnosti reprezentovaných jazyků pro různé třídy ω-automatů jsou tyto automaty vhodné pro metody ověřování modelu se specifikací zadanou …moreAbstract:
As ω-automata are a convenient representation of languages of infinite words, they are widespread in the area of formal methods; many algorithms that analyze systems with infinite behaviours rely on ω-automata. The efficient algorithms for the intersection, union, and emptiness checking for various classes of ω-automata made them appealing for model checking of properties expressed as ω-regular languages …more
Language used: English
Date on which the thesis was submitted / produced: 16. 3. 2018
Identifier:
https://is.muni.cz/th/gwriw/
Thesis defence
- Date of defence: 25. 6. 2018
- Supervisor: doc. RNDr. Jan Strejček, Ph.D.
- Reader: Prof. Orna Kupferman, Prof. Christel Baier
Citation record
ISO 690-compliant citation record:
BLAHOUDEK, František. \textit{Automata for Formal Methods: Little Steps Towards Perfection}. Online. Doctoral theses, Dissertations. Brno: Masaryk University, Faculty of Informatics. 2018. Available from: https://theses.cz/id/8z875b/.
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 InformaticsDoctoral programme / field:
Informatics (4-years) / Informatics
Theses on a related topic
-
Translation of Linear Temporal Logic to Omega-Automata
Tomáš Babiak -
Translation of an LTL fragment to deterministic Rabin and Streett automata
František Blahoudek -
Transformation of Nondeterministic Büchi Automata to Tight Automata
Marek Jankola -
Refined Büchi automata for faster model checking
Vojtěch Rujbr -
Mapping the Omega-Automata Jungle
Tomáš Macháček -
Tight Omega-Automata
Marek Jankola -
Untimed LTL Model Checking of Timed Automata
Jan Havlíček -
Refined Büchi automata for faster model checking
Vojtěch Rujbr