Satisfiability and model checking for MSO-definable temporal logics are in PSPACE

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2761, Issue , 2003, Pages 222-236

  Gastin, Paul ^a   Kuske, Dietrich ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; TEMPORAL LOGIC;

COMPLEXITY RESULTS; CONCURRENT SYSTEMS; KRIPKE STRUCTURE; MAZURKIEWICZ TRACES; MODEL CHECKING PROBLEM; SATISFIABILITY; SATISFIABILITY PROBLEMS; UNIFIED FRAMEWORK;

MODEL CHECKING;

EID: 35248874238     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45187-7_15     Document Type: Article

References (17)

1. R. Alur, R. Peled, and W. Penczek. Model checking of causality properties. In LICS 95, pages 90-100. IEEE Computer Society Press, 1995.
2. J.R. Büchi. On a decision method in restricted second order arithmetics. In E. Nagel et al., editors, Proc. Intern. Congress on Logic, Methodology and Philosophy of Science, pages 1-11. Stanford University Press, Stanford, 1960.
3. V. Diekert. A pure future local temporal logic beyond cograph-monoids. In M. Ito, editor, Proc. of the RIMS Symposium on Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory, Kyoto, Japan 2002, 2002.
4. V. Diekert and P. Gastin. Local temporal logic is expressively complete for cograph dependence alphabets. In LPAR 01, Lecture Notes in Artificial Intelligence vol. 2250, pages 55-69. Springer, 2001.
5. V. Diekert and P. Gastin. Local temporal logic is expressively complete for cograph dependence alphabets. Tech. Rep. LIAFA, Université Paris 7 (France), 2003. http://www.liafa.jussieu.fr/∼gastin/Articles/diegas03.html.
6. V. Diekert and G. Rozenberg. The Book of Traces. World Scientific Publ. Co., 1995.
7. P. Gastin and M. Mukund. An elementary expressively complete temporal logic for Mazurkiewicz traces. In Proc. of ICALP'02, number 2380 in LNCS, pages 938-949. Springer Verlag, 2002.
8. H.W. Kamp. Tense logic and the theory of linear order. PhD thesis, University of California, Los Angeles, USA, 1968.
9. O. Kupferman, N. Piterman, and M.Y. Vardi. Extended temporal logic revisited. In Proc. of CONCUR'01, number 2154 in LNCS, pages 519-535. Springer Verlag, 2001.
10. M. Mukund and M. Sohoni. Keeping trace of the latest gossip: bounded time-stamps suffice. In Proc. of FST&TCS'93, number 761 in LNCS, pages 388-399. Springer Verlag, 1993.
11. M. Mukund and P.S. Thiagarajan. Linear time temporal logics over Mazurkiewicz traces. In Proc. of MFCS'96, number 1113 in LNCS, pages 62-92. Springer Verlag, 1996.
12. A. Rabinovich and S. Maoz. An infinite hierarchy of temporal logics over branching time. Information and Computation, 171(2):306-332, 2001.
13. P.S. Thiagarajan. A trace based extension of linear time temporal logic. In Proc. of LICS'94, pages 438-447. IEEE Computer Society Press, 1994.
14. P.S. Thiagarajan. A trace consistent subset of PTL. In Proc. of CONCUR'95, number 962 in LNCS, pages 438-452, 1995.
15. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 133-191. Elsevier Science Publ. B.V., 1990.
16. M.Y. Vardi and P. Wolper. Reasonning about infinite computations. Information and Computation, 115:1-37, 1994.
17. P. Wolper. Temporal logic can be more expressive. Inf. and Control, 56:72-99, 1983.