Local LTL with past constants is expressively complete for Mazurkiewicz traces

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

Volumn 2747, Issue , 2003, Pages 429-438

  Gastin, Paul ^a   Mukund, Madhavan ^b   Narayan Kumar, K ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

Concurrency; Mazurkiewicz traces; Temporal logics

Indexed keywords

FORMAL LOGIC;

CONCURRENCY; LINEAR TIME TEMPORAL LOGIC; MAZURKIEWICZ TRACES;

TEMPORAL LOGIC;

EID: 21144456922     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_37     Document Type: Article

References (24)

1. B. Adsul and M. Sohoni. Complete and tractable local linear time temporal logics over traces. In Proc. of ICALP'02, LNCS 2380, 926-937. Springer Verlag, 2002.
2. J. Cohen, D. Perrin, and J.-E. Pin. On the expressive power of temporal logic. Journal of Computer and System Sciences, 46:271-295, 1993.
3. V. Diekert and P. Gastin. Local temporal logic is expressively complete for cograph dependence alphabets. In Proc. of LPAR'01, LNAI 2250, 55-69. Springer Verlag, 2001.
4. V. Diekert and P. Gastin. LTL is expressively complete for Mazurkiewicz traces. Journal of Computer and System Sciences, 64:396-418, 2002.
5. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
6. W. Ebinger. Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken. Dissertation, Institut für Informatik, Universität Stuttgart, 1994.
7. W. Ebinger and A. Muscholl. Logical definability on infinite traces. Theoretical Computer Science, 154:67-84, 1996.
8. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proc. of PoPL'80, 163-173, Las Vegas, Nev., 1980.
9. P. Gastin and D. Kuske. Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. To appear in Proc. of CONCUR'03.
10. P. Gastin and M. Mukund. An elementary expressively complete temporal logic for Mazurkiewicz traces. In Proc. of ICALP'02, LNCS 2380, 938-949. Springer Verlag, 2002.
11. P. Gastin, M. Mukund, and K. Narayan Kumar. Local LTL with past constants is expressively complete for Mazurkiewicz traces. Tech. Rep. 2003-008, LIAFA, Université Paris 7 (France), 2003.
12. J.A.W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, California, 1968.
13. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
14. R. McNaughton and S. Papert. Counter-Free Automata. MIT Press, 1971.
15. D. Perrin. Recent results on automata and infinite words. In Proc. of MFCS'84, LNCS 176, 134-148. Springer Verlag, 1984.
16. D. Perrin and J.-E. Pin. First order logic and star-free sets. Journal of Computer and System Sciences, 32:393-406, 1986.
17. A. Pnueli. The temporal logic of programs. In FOCS'77, 46-57, 1977.
18. M.-P. Schützenberger. On finite monoids having only trivial subgroups. Information and Control, 8:190-194, 1965.
19. P.S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proc. of LICS'97, 183-194, 1997.
20. W. Thomas. Star-free regular sets of ω-sequences. Information and Control, 42:148-156, 1979.
21. I. Walukiewicz. Difficult configurations - on the complexity of LTrL. In Proc. of ICALP'98, LNCS 1443, 140-151. Springer Verlag, 1998.
22. I. Walukiewicz. Local logics for traces. Journal of Automata, Languages and Combinatorics, 7(2):259-290, 2002.
23. Th. Wilke. Classifying discrete temporal properties. In Proc. of STACS'99, LNCS 1563, 32-46. Springer Verlag, 1999.
24. W. Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. - Informatique Théorique et Applications, 21:99-135, 1987.