A (Non-elementary) Modular Decision Procedure for LTrL

Thiagarajan and Walukiewicz [18] have defined a temporal logic LTrL on Mazurkiewicz traces, patterned on the famous propositional temporal logic of linear time LTL defined by Pnueli. They have shown that this logic is equal in expressive power to the first order theory of finite and infinite traces.

[1]  Nils Klarlund,et al.  Mona & Fido: The Logic-Automaton Connection in Practice , 1997, CSL.

[2]  P. S. Thiagarajan,et al.  A trace based extension of linear time temporal logic , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[3]  Volker Diekert,et al.  The Book of Traces , 1995 .

[4]  S. Safra.  On The Complexity of w-Automata , 1988 .

[5]  Tiziana Margaria,et al.  MOSEL: A FLexible Toolset for Monadic Second-Order Logic , 1997, TACAS.

[6]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

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

[8]  Courcoubetis M. Vardi P. Wolper M. Yannakakis.  Memory-E cient Algorithms for theVeri cationof Temporal PropertiesC , 1992 .

[9]  Igor Walukiewicz,et al.  An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces , 1996 .

[10]  Pierre Wolper,et al.  Memory-efficient algorithms for the verification of temporal properties , 1990, Formal Methods Syst. Des..

[11]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[12]  Ramaswamy Ramanujam,et al.  Locally linear time temporal logic , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[13]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[14]  Wojciech Penczek,et al.  Model-checking of causality properties , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[15]  Antoine Petit,et al.  Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof , 1998, STACS.

[16]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[17]  Werner Ebinger.  Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken , 1994 .

[18]  Igor Walukiewicz,et al.  Difficult Configurations—On the Complexity of LTrL , 1998, Formal Methods Syst. Des..