Zpět na vyhledávání

Bc. Juraj Major

Master's thesis

Překlad LTL na nedeterministické automaty s generickou akceptační podmínkou

Translation of LTL into nondeterministic automata with generic acceptance condition
Abstract:
Záverečná práca sa zameriava na preklad LTL na konečné automaty nad nekonečnými slovami pomocou alternujúcich automatov. Navrhuje nový algoritmus prekladu, ktorý používa všeobecnú akceptačnú podmienku, s cieľom zmenšiť veľkosť výsledných automatov.
Abstract:
The thesis focuses on the translation of LTL to finite automata over infinite words via alternating automata. We suggest a new translation algorithm that uses a generic acceptance condition to decrease the size of the resultant automata.
 

Keywords

LTL omega-automata alternating automata nondeterministic automata generic acceptance condition HOAF
 
Language used: English
Date on which the thesis was submitted / produced: 4. 1. 2017
Identifier: https://is.muni.cz/th/o0rn5/

Thesis defence

  • Date of defence: 10. 2. 2017
  • Supervisor: RNDr. František Blahoudek
  • Reader: prof. RNDr. Ivana Černá, CSc.

Citation record

Cite this text

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 informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Master programme / field:
Applied Informatics / Applied Informatics

Theses on a related topic

List of theses with an identical keyword.
All theses