Transformation from PLTL to automata via NFGs

A new linear transformation from PLTL formulas to alternating automata is proposed in this paper. To this end, C-F normal forms and normal form graphs (NFGs) are defined for PLTL formulas. Further, based on NFGs, generalized alternating Büchi automata (GABA) of PLTL formulas are built. Beside the conciseness in theoretical aspect, the new transformation is useful in improving the scalability of LTL model checking tools in practise. Also, based on the new transformation, an intuitive on-the-fly model checking approach can be implemented.

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

[2]  Ernst L. Leiss,et al.  On Equations for Regular Languages, Finite Automata, and Sequential Networks , 1980, Theor. Comput. Sci..

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

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

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

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

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

[8]  Joost P. Katoen,et al.  Concepts, Algorithms, and Tools for Model Checking , 1999 .

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

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

[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]  Moshe Y. Vardi.  Nontraditional Applications of Automata Theory , 1994, TACS.

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

[16]  Moshe Y. Vardi.  Alternating Automata and Program Verification , 1995, Computer Science Today.

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

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

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