Bc. Ondřej Kuzník
Master's thesis
Model Checking of promt-LTL properties
Model Checking of promt-LTL properties
Abstract:
Logika LTL si, od chvíle, kdy byl poprvé publikován algoritmus pro její model-checking, získala mnoho uživatelů pro svou kombinaci množství popsatelných vlastností a jednoduchosti jejich popisu. Lidé jsou nicméně občas zlákáni v myšlenku, že splnění vlastnosti typu "živost" implikuje i "včasnost", že je délka čekání i nějak omezena. Pro tento účel rozšířili Vardi a kol. tuto logiku o operátor omezené …moreAbstract:
Over the years since model checking has been introduced, LTL has gained a respectable position for striking a good compromise between simplicity and expressiveness. However, people often find themselves misled into thinking that satisfaction of a liveness property implies a bound on the wait time, promptness. For this very reason Vardi et al. proposed an extension of LTL, adding a prompt-future operator …more
Language used: English
Date on which the thesis was submitted / produced: 25. 5. 2009
Identifier:
https://is.muni.cz/th/fpfgf/
Thesis defence
- Date of defence: 29. 6. 2009
- Supervisor: prof. RNDr. Ivana Černá, CSc.
- Reader: RNDr. Nikola Beneš, Ph.D.
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 / Informatics
Theses on a related topic
-
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 -
Automata for Formal Methods: Little Steps Towards Perfection
František Blahoudek -
Tight Omega-Automata
Marek Jankola