Uniform satisfiability problem for local temporal logics over mazurkiewicz traces

Information and Computation

Volumn 208, Issue 7, 2010, Pages 772-796

  Gastin, Paul ^a   Kuske, Dietrich ^a,b  

^a CNRS   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TEMPORAL LOGIC;

CONCURRENT SYSTEMS; LOWER AND UPPER BOUNDS; MAZURKIEWICZ TRACES; SATISFIABILITY PROBLEMS;

FORMAL LOGIC;

EID: 77955328360     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2010.01.003     Document Type: Article

References (24)

1. B. Adsul, M. Sohoni, Complete and tractable local linear time temporal logics over traces, in: Proceedings of the ICALP'02, LNCS, vol. 2380, Springer, Berlin, 2002, pp. 926-937.
2. R. Alur, D. Peled, W. Penczek, Model-checking of causality properties, in: Proceedings of the LICS'95, IEEE Computer Society Press, Silver Spring, MD, 1995, pp. 90-100.
3. V. Diekert, and P. Gastin Local temporal logic is expressively complete for cograph dependence alphabets Information and Computation 195 2004 30 52 a preliminary version appeared at LPAR'01, LNAI 2250, Springer, Berlin, pp. 55-69
4. V. Diekert, G. Rozenberg, The Book of Traces 1995 World Scientific Singapore
5. V. Diekert, P. Gastin, Pure future local temporal logics are expressively complete for Mazurkiewicz traces, in: Proceedings of the LATIN'04, LNCS, vol. 2976, Springer, Berlin, 2004, pp. 232-241.
6. H.-D. Ebbinghaus, and J. Flum Finite Model Theory 1991 Springer Berlin
7. D. Gabbay, I. Hodkinson, and M. Reynolds Temporal Logic 1994 Oxford University Press Oxford
8. P. Gastin, and D. Kuske Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces Fundamenta Informaticae 80 1-3 2007 169 197
9. P. Gastin, M. Mukund, An elementary expressively complete temporal logic for Mazurkiewicz traces, in: Proceedings of the ICALP'02, LNCS, vol. 2380, Springer, Berlin, 2002, pp. 938-949.
10. P. Gastin, D. Kuske, Satisfiability and model checking for MSO-definable temporal logics are in PSPACE, in: Proceedings of the CONCUR'03, LNCS, vol. 2761, Springer, Berlin, 2003, pp. 222-236.
11. P. Gastin, M. Mukund, K. Narayan Kumar, Local LTL with past constants is expressively complete for Mazurkiewicz traces, in: Proceedings of the MFCS'03, LNCS, vol. 2747, Springer, Berlin, 2003, pp. 429-438.
12. P. Gastin, D. Kuske, Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces, in: Proceedings of the CONCUR'05, LNCS, vol. 3653, Springer, Berlin, 2005, pp. 533-547.
13. H.J. Keisler, and W.B. Lotfallah Shrinking games and local formulas Annals of Pure and Applied Logic 128 1-3 2004 215 225
14. Y. Kesten, A. Pnueli, L. Raviv, Algorithmic verification of linear temporal logic specifications, in: Proceedings of the ICALP'98, LNCS, vol. 1443, Springer, Berlin, 1998, pp. 1-16.
15. O. Kupferman, and M. Vardi Weak alternating automata are not that weak ACM Transaction on Computational Logic 2 3 2001 408 429
16. O. Matz, Dot-depth and monadic quantifier alternation over pictures, Ph.D. Thesis, RWTH Aachen, 1999.
17. O. Matz, N. Schweikardt, and W. Thomas The monadic quantifier alternation hierarchy over grids and graphs Information and Computation 179 2 2002 356 383
18. S. Miyano, and T. Hayashi Alternating finite automata on ω -words Theoretical Computer Science 32 1984 321 330
19. M. Mukund, P. Thiagarajan, Linear time temporal logics over Mazurkiewicz traces, in: Proceedings of the MFCS'96, LNCS, vol. 13, Springer, Berlin, 1996, pp. 62-92.
20. D.E. Muller, A. Saoudi, P. E. Schupp, Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time, in: Proceedings of the LICS'88, IEEE Computer Society Press, Silver Spring, MD, 1988, pp. 422-427.
21. T. Schwentick, and K. Bartelmann Local normal forms for first-order logic with applications to games and automata Discrete Mathematics and Computer Science 3 1999 109 124
22. P. Thiagarajan, A trace based extension of linear time temporal logic, in: Proceedings of the LICS'94, IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 438-447.
23. P. Thiagarajan, A trace consistent subset of PTL, in: Proceedings of the CONCUR'95, LNCS, vol. 962, Springer, Berlin, 1995, pp. 438-452.
24. I. Walukiewicz Difficult configurations-on the complexity of LTrL Formal Methods in System Design 26 1 2005 27 43