Deciding LTL over Mazurkiewicz traces

Linear temporal logic (LTL) has become a well established tool for specifying the dynamic behaviour of reactive systems with an interleaving semantics, and the automata-theoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to understand decision procedures and directly yield further on-the-fly model checking procedures. In this paper, we exhibit a decision procedure for LTL over Mazurkiewicz traces that generalises the classical automata-theoretic approach to a LTL interpreted no longer over sequences but certain partial orders. Specifically, we construct a (linear) alternating Buchi automaton (ABA) accepting the set of linearisations of traces satisfying the formula at hand. The salient point of our technique is to apply a notion of independence-rewriting to formulas of the logic. Furthermore, we show that the class of linear and trace-consistent ABA corresponds exactly to LTL formulas over Mazurkiewicz traces, lifting a similar result from Loding and Thomas formulated in the framework of LTL over words.

[1]  Orna Kupferman,et al.  An Automata-Theoretic Approach to Reasoning about Infinite-State Systems , 2000, CAV.

[2]  Anca Muscholl,et al.  Logical Definability on Infinite Traces , 1996, Theor. Comput. Sci..

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

[4]  Paul Gastin,et al.  A (Non-elementary) Modular Decision Procedure for LTrL , 1998, MFCS.

[5]  Gareth S. Rohde,et al.  Alternating automata and the temporal logic of ordinals , 1997 .

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

[7]  Gerard J. Holzmann,et al.  The SPIN Verification System , 1997 .

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

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

[10]  Antti Valmari.  A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..

[11]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

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

[13]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract) , 1994, CAV.

[14]  Igor Walukiewicz,et al.  An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces , 1997, Inf. Comput..

[15]  Christof Löding,et al.  Alternating Automata and Logics over Infinite Words , 2000, IFIP TCS.

[16]  Doron A. Peled,et al.  Ten Years of Partial Order Reduction , 1998, CAV.

[17]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[18]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[19]  Martin Leucker,et al.  Logics for Mazurkiewicz traces , 2002 .

[20]  Paul Gastin,et al.  LTL Is Expressively Complete for Mazurkiewicz Traces , 2000, J. Comput. Syst. Sci..

[21]  Nils Klarlund,et al.  Mona: Monadic Second-Order Logic in Practice , 1995, TACAS.

[22]  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.