Thesis/Dissertation: Marek Jankola: Transformation of Nondeterministic Büchi Automata to Tight Automata
Bachelor's thesis
Transformation of Nondeterministic Büchi Automata to Tight Automata
Abstract
Model checking je technika, ktorá slúži na overenie, či naprogramovaný systém spĺňa danú vysokoúrovňovú špecifikáciu. V prípade, že ju nespĺňa, model checker vráti protipríklad. Avšak tento protipríklad nemusí byť najkratší možný. Existuje špeciálny typ Büchiho automatu – tight Büchiho automat, z ktorého dokáže model checker vždy vrátiť najkratší protipríklad. Cieľ tejto práce je navrhnúť algoritmus …more
Abstract
Model checking is a technique to verify whether a programmed system satisfies a given high-level specification or not. If it does not meet the specification, the model checker returns a counterexample. However, this counterexample might not be the shortest. There is a specific type of Büchi automaton - tight Büchi automaton from which the model checker can always return the shortest counterexample …more
Thesis description
27/5/2021 12:17, prof. RNDr. Jan Strejček, Ph.D., UČO 3366
Attachments
TransformationAlgorithm.zip
Theses on a related topic
List of theses with an identical keyword.
-
Transformation of Büchi Automata to Smaller Tight Automata
Bc. Karel Procházka -
Automata for Formal Methods: Little Steps Towards Perfection
RNDr. František Blahoudek, Ph.D. -
Tight Omega-Automata
Mgr. Marek Jankola -
Mapping the Omega-Automata Jungle
Mgr. Tomáš Macháček -
Translation of Linear Temporal Logic to Omega-Automata
RNDr. Tomáš Babiak, Ph.D., UČO 143254 -
Translation of LTL to omega-automata
RNDr. Tomáš Babiak, Ph.D., UČO 143254 -
Verification of probabilistic systems against quantified linear properties
RNDr. Jana Tůmová, Ph.D., UČO 98614 -
Refined Büchi automata for faster model checking
Ing. Mgr. Vojtěch Rujbr, UČO 370641




