Back to search

Bc. Marek Jankola

Master's thesis

Tight Omega-Automata

Tight Omega-Automata
Abstract:
Tight automaty sa používajú na vrátenie najkratšieho protipríkladu v LTL model checking-u alebo na konštrukciu maximálne splňujúcej stratégie v LTL syntéze stratégií. Táto téza rozširuje formalizmus tight state-based Büchiho automatu (BA) na univerzálnu triedu ω-automatov, tight transition-based Emerson-Lei automaty (TELA). Predstavujeme nový spôsob transformácie ľubovoľného transition-based Büchiho …more
Abstract:
Tight automata are useful in providing the shortest counterexample in LTL model checking or in constructing a maximally satisfying strategy in LTL strategy synthesis. This thesis extends the formalism of tight state-based Büchi automata (BA) to the universal class of ω-automata, tight transition-based Emerson-Lei automata (TELA). We provide a new approach for transforming an arbitrary transition-based …more
 

Keywords

Büchi automata Emerson-Lei automata model checking strategy synthesis omega-automata shortest counterexample tight Büchi au- tomata
 
Language used: English
Date on which the thesis was submitted / produced: 16. 5. 2023
Identifier: https://is.muni.cz/th/y8hv7/

Thesis defence

  • Date of defence: 19. 6. 2023
  • Supervisor: prof. RNDr. Jan Strejček, Ph.D.
  • Reader: prof. RNDr. Jiří Barnat, Ph.D.

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:
Theoretical computer science / Formal analysis of computer systems

Theses on a related topic

List of theses with an identical keyword.
All theses