Decomposition of TrPTL Formulas

Partial orders based verifications methods are now well developed. In this framework, several suitable logics have already been defined. We focus on this paper on the logic TrPTL, as defined by Thiagarajan, for which models are the well known (infinite) Mazurkiewicz traces. We study the case where the alphabet is not connected. Our main theoretical result is that any TrPTL formula can be decomposed in an effective way as the disjunction of formulas on the connected components. Note that this result can be viewed as a direct logical counterpart of the famous Mezei's theorem on recognizable sets in a direct product of free monoids.

[1]  Igor Walukiewicz,et al.  An expressively complete linear time temporal logic for Mazurkiewicz traces , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[2]  Volker Diekert,et al.  Combinatorics on Traces , 1990, Lecture Notes in Computer Science.

[3]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[4]  Wojciech Penczek,et al.  Traces and Logic , 1995, The Book of Traces.

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

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

[7]  Madhavan Mukund,et al.  Linear time temporal logics over Mazurkiewicz traces , 1996, Partial Order Methods in Verification.

[8]  Paul Gastin,et al.  An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces , 1994, Theor. Comput. Sci..

[9]  Pierre Wolper,et al.  A Partial Approach to Model Checking , 1994, Inf. Comput..

[10]  Wojciech Penczek,et al.  A Temporal Logic for Event Structures , 1990 .

[11]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[12]  Doron A. Peled,et al.  Interleaving set temporal logic , 1987, PODC '87.

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

[14]  MuschollUniversit.  Logical De nability on In nite Traces Werner Ebinger and Anca , 1993 .

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

[16]  P. S. Thiagarajan,et al.  Temporal Logics for Communicating Sequential Agents: I , 1992, Int. J. Found. Comput. Sci..

[17]  Paul Gastin,et al.  Asynchronous Cellular Automata for Infinite Traces , 1992, ICALP.

[18]  Madhavan Mukund,et al.  A Logical Characterization of Well Branching Event Structures , 1992, Theor. Comput. Sci..

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

[20]  Wojciech Zielonka,et al.  The Book of Traces , 1995 .