LTL to Deterministic Emerson-Lei Automata

We introduce a new translation from linear temporal logic (LTL) to deterministic Emerson-Lei automata, which are omega-automata with a Muller acceptance condition symbolically expressed as a Boolean formula. The richer acceptance condition structure allows the shift of complexity from the state space to the acceptance condition. Conceptually the construction is an enhanced product construction that exploits knowledge of its components to reduce the number of states. We identify two fragments of LTL, for which one can easily construct deterministic automata and show how knowledge of these components can reduce the number of states. We extend this idea to a general LTL framework, where we can use arbitrary LTL to deterministic automata translators for parts of formulas outside the mentioned fragments. Further, we show succinctness of the translation compared to existing construction. The construction is implemented in the tool Delag, which we evaluate on several benchmarks of LTL formulas and probabilistic model checking case studies.

[1]  Fabio Somenzi,et al.  Efficient Büchi Automata from LTL Formulae , 2000, CAV.

[2]  Thomas Wilke,et al.  Complementation, Disambiguation, and Determinization of Büchi Automata Unified , 2008, ICALP.

[3]  Jan Kretínský,et al.  MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata , 2016, ATVA.

[4]  Jan Kretínský,et al.  Limit-Deterministic Büchi Automata for Linear Temporal Logic , 2016, CAV.

[5]  Christel Baier,et al.  On-the-Fly Stuttering in the Construction of Deterministic ω-Automata , 2007 .

[6]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[7]  Klaus Schneider,et al.  Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis , 2010, GANDALF.

[8]  Lijun Zhang,et al.  Verify LTL with Fairness Assumptions Efficiently , 2016, 2016 23rd International Symposium on Temporal Representation and Reasoning (TIME).

[9]  Alexandre Duret-Lutz,et al.  Spot 2 . 0 — a framework for LTL and ω-automata manipulation , 2016 .

[10]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[11]  Roman R. Redziejowski.  An Improved Construction of Deterministic Omega-automaton Using Derivatives , 2012, Fundam. Informaticae.

[12]  Nir Piterman.  From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata , 2007, Log. Methods Comput. Sci..

[13]  Christel Baier,et al.  Are Good-for-Games Automata Good for Probabilistic Model Checking? , 2014, LATA.

[14]  Moshe Y. Vardi,et al.  On ω-automata and temporal logic , 1989, STOC '89.

[15]  Thomas A. Henzinger,et al.  Solving Games Without Determinization , 2006, CSL.

[16]  Jan Kretínský,et al.  From LTL to Deterministic Automata: A Safraless Compositional Approach , 2014, CAV.

[17]  Dana Fisman,et al.  A Modular Approach for Büchi Determinization , 2015, CONCUR.

[18]  Lijun Zhang,et al.  Lazy Probabilistic Model Checking without Determinisation , 2013, CONCUR.

[19]  Sven Schewe,et al.  Tighter Bounds for the Determinisation of Büchi Automata , 2009, FoSSaCS.

[20]  Orna Kupferman,et al.  Safraless Compositional Synthesis , 2006, CAV.

[21]  Klaus Schneider,et al.  From LTL to Symbolically Represented Deterministic Automata , 2008, VMCAI.

[22]  C. Baier,et al.  Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic , 2005 .

[23]  George S. Avrunin,et al.  Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[24]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[25]  Jan Kretínský,et al.  From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata , 2017, TACAS.

[26]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[27]  Jan Strejcek,et al.  Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment , 2013, ATVA.