LtlNfBa: Making LTL Translation More Practical

We improve LTL2BA with a new algorithm for constructing Buchi automata from LTL formulas. The core of the new algorithm is a so called CF-normal form which presents an LTL formula in the current and future form. With the aid of well developed reduction rules in LTL2BA and new rules concerning combination of always and eventually operations, the improved translator named LtlNfBa is competitive with the current leading tools LTL3BA and SPOT.

[1]  Pierre Wolper,et al.  Reasoning about infinite computation paths , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[2]  Adam Czubak,et al.  Minimal Büchi Automata for Certain Classes of LTL Formulas , 2009, 2009 Fourth International Conference on Dependability of Computer Systems.

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

[4]  Vojtech Rehák,et al.  LTL to Büchi Automata Translation: Fast and More Deterministic , 2012, TACAS.

[5]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[6]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[7]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[9]  Denis Poitrenaud,et al.  SPOT: an extensible model checking library using transition-based generalized Bu/spl uml/chi automata , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[10]  Fausto Giunchiglia,et al.  Improved Automata Generation for Linear Temporal Logic , 1999, CAV.

[11]  Li Zhang,et al.  A decision procedure for propositional projection temporal logic with infinite models , 2008, Acta Informatica.

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

[13]  Edmund M. Clarke,et al.  Another Look at LTL Model Checking , 1994, CAV.

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

[15]  Carsten Fritz,et al.  Concepts of Automata Construction from LTL , 2005, LPAR.

[16]  Xavier Thirioux.  Simple and Efficient Translation from LTL Formulas to Buchi Automata , 2002, Electron. Notes Theor. Comput. Sci..

[17]  Moshe Y. Vardi.  Automata-Theoretic Model Checking Revisited , 2007, VMCAI.

[18]  Moshe Y. Vardi.  Nontraditional Applications of Automata Theory , 1994, TACS.

[19]  Zhenhua Duan,et al.  A note on stutter-invariant PLTL , 2009, Inf. Process. Lett..

[20]  Carsten Fritz,et al.  Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata , 2003, CIAA.

[21]  Jean-Michel Couvreur,et al.  On-the-Fly Verification of Linear Temporal Logic , 1999, World Congress on Formal Methods.

[22]  Zhenhua Duan,et al.  An extended interval temporal logic and a framing technique for temporal logic programming , 1996 .