Translation of an LTL fragment to deterministic Rabin and Streett automata – Bc. František Blahoudek
Bc. František Blahoudek
Master's thesis
Translation of an LTL fragment to deterministic Rabin and Streett automata
Translation of an LTL fragment to deterministic Rabin and Streett automata
Abstract:
Překlad LTL na deterministické omega-automaty se obvykle skládá z překladu na nedeterministické Buchiho automaty a jejich následné determinizace, např. Safrovou konstrukcí. V této diplomové práci je popsán překlad LTL fragmentu LTL(F, G) na deterministické automaty pomocí lineárních alternujících automatů speciálního tvaru, tzv. must/may automatů. Výslednými automaty jsou generalizované Rabinovy automaty …moreAbstract:
The usual translation of LTL into deterministic omega-automata consists of translation to non-deterministic Buchi automata and determinization of such automata by some general algorithm such as Safra’s construction. In this thesis we describe a translation of the LTL fragment LTL(F, G) to deterministic automata via a special kind of very weak alternating automata called must/may automata. We use transition …more
Language used: English
Date on which the thesis was submitted / produced: 28. 5. 2012
Identifier:
https://is.muni.cz/th/kr9t4/
Thesis defence
- Date of defence: 26. 6. 2012
- Supervisor: doc. RNDr. Jan Strejček, Ph.D.
- Reader: prof. RNDr. Mojmír Křetínský, CSc.
Citation record
ISO 690-compliant citation record:
BLAHOUDEK, František. \textit{Translation of an LTL fragment to deterministic Rabin and Streett automata}. Online. Master's thesis. Brno: Masaryk University, Faculty of Informatics. 2012. Available from: https://theses.cz/id/34hzat/.
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 / Parallel and Distributed Systems
Theses on a related topic
-
Translation of Linear Temporal Logic to Omega-Automata
Tomáš Babiak -
Linear Temporal Logic and omega-automata
František Blahoudek -
Runtime Verification of Linear Temporal Specifications with Degradation
Tomáš Staňa -
Control Strategy Synthesis for Path Planning under Temporal Constraints
Mária Svoreňová -
Temporal attribute implications
Jan TŘÍSKA -
Quantitative Linear-Time Model Checking
Jana Tůmová -
Almost linear Bűchi automata
Tomáš Babiak -
Translation of LTL to Semi-Deterministic Automata via Alternating Automata
Michal Románek