Diicult Conngurations | on the Complexity of Ltrl

The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also called connguration. The logic is shown to be non-elementary with the main reason for this complexity being the nesting of until operators in formulas. The fragment of the logic without the until operator is shown to be EXPSPACE-complete.

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

[2]  P. Thiagarajan,et al.  An expressively complete linear time temporal logic for Mazurkiewicz traces , 1996, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

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

[4]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

[5]  Doron A. Peled,et al.  Partial Order Reduction: Model-Checking Using Representatives , 1996, MFCS.

[6]  Wojciech Penczek.  On Undecidability of Propositional Temporal Logics on Trace Systems , 1992, Inf. Process. Lett..

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

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

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

[10]  Patrice Godefroid,et al.  Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

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

[12]  P. S. Thiagarajan,et al.  A Logical Study of Distributed Transition Systems , 1995, Inf. Comput..

[13]  Editors , 2003 .