Journal ArticleDOI
From LTL to deterministic automata
Javier Esparza,Jan Křetínský,Salomon Sickert +2 more
- Vol. 49, Iss: 3, pp 219-271
Reads0
Chats0
TLDR
A new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula that has a clear logical structure, which allows for various optimizations.Abstract:
We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula $$\varphi $$ź. The automaton is the product of a co-Buchi automaton for $$\varphi $$ź and an array of Rabin automata, one for each $${\mathbf {G}}$$G-subformula of $$\varphi $$ź. The Rabin automaton for $${\mathbf {G}}\psi $$Gź is in charge of recognizing whether $${\mathbf {F}}{\mathbf {G}}\psi $$FGź holds. This information is passed to the co-Buchi automaton that decides on acceptance. As opposed to standard procedures based on Safra's determinization, the states of all our automata have a clear logical structure, which allows for various optimizations. Experimental results show improvement in the sizes of the resulting automata compared to existing methods.read more
Citations
More filters
Book ChapterDOI
Owl: A Library for $$\omega $$-Words, Automata, and LTL
TL;DR: The library Owl is presented, which forms a backbone of several translations from LTL to automata and related tools by different authors and is apt for easy prototyping of new tools in this area.
Book ChapterDOI
Rabinizer 4: From LTL to Your Favourite Deterministic Automaton
TL;DR: Rabinizer 4 is presented, a tool set for translating formulae of linear temporal logic to different types of deterministic \(\omega \)-automata and enhancements both in terms of the size of the automata and the computational time are shown, due to algorithmic as well as implementation improvements.
Book ChapterDOI
The 10,000 Facets of MDP Model Checking
TL;DR: The manifold facets of this field of research are discussed by surveying the verification of various MDP extensions, rich classes of properties, and their applications by surveyed the basic ingredients of MDP model checking.
Proceedings ArticleDOI
One Theorem to Rule Them All: A Unified Translation of LTL into {\omega}-Automata
TL;DR: A unified translation of LTL formulas into deterministic Rabin automata, limit-deterministic Büchi Automata, and nondeterministicBüchi automata derived from one single Master Theorem of purely logical nature is presented.
References
More filters
Book
Principles of Model Checking
TL;DR: Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.
Book
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
TL;DR: This presentation discusses Functional Programming in HOL, which aims to provide students with an understanding of the programming language through the lens of Haskell.
Book ChapterDOI
PRISM 4.0: verification of probabilistic real-time systems
TL;DR: A major new release of the PRISMprobabilistic model checker is described, adding, in particular, quantitative verification of (priced) probabilistic timed automata.
Proceedings ArticleDOI
Patterns in property specifications for finite-state verification
TL;DR: A survey of available specifications found that most are instances of the proposed pattern-based approach to the presentation, codification and reuse of property specifications for finite-state verification.
Book
Principles of Model Checking (Representation and Mind Series)
TL;DR: Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.