An expressively complete temporal logic without past tense operators for Mazurkiewicz traces

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

Volumn 1683, Issue , 1999, Pages 188-203

  Diekert, Volker ^a   Gastin, Paul ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Concurrency; Mazurkiewicz traces; Temporal logics

Indexed keywords

COMPUTER CIRCUITS;

CONCURRENCY; DIRECT APPROACH; EXPRESSIVE POWER; FINITE WORDS; FIRST ORDER THEORIES; INFINITE WORD; LINEAR TIME TEMPORAL LOGIC; MAZURKIEWICZ TRACES;

TEMPORAL LOGIC;

EID: 0009239293     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_14     Document Type: Conference Paper

References (23)

1. R. Alur, D. Peled, and W. Penczek. Model-checking of causality properties. In Proceedings of LICS’95, pages 90-100, 1995.
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 G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
4. W. Ebinger. Charakterisierung von Sprachklassen unendlicher Spuren durch Logi-ken. Dissertation, Institut für Informatik, Universität Stuttgart, 1994.
5. W. Ebinger and A. Muscholl. Logical definability on infinite traces. Theoretical Computer Science, 154:67-84, 1996. A preliminary version appeared in Proceedings of the 20th International Colloquium on Automata, Languages and Programming (ICALP’93), Lund (Sweden) 1993, Lecture Notes in Computer Science 700, 1993.
6. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Conference Record of the 12th ACM Symposium on Principles of Programming Languages, pages 163-173, Las Vegas, Nev., 1980.
7. P. Gastin, R. Meyer, and A. Petit. A (non-elementary) modular decision procedure for ltrl. In L. Brim, F. Gruska, and J. Zlatuska, editors, Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS’98), number 1450 in Lecture Notes in Computer Science, pages 356-365. Springer, 1998.
8. P. Gastin and A. Petit. Infinite traces. In V. Diekert and G. Rozenberg, editors, The Book of Traces, chapter 11, pages 393-486. World Scientific, Singapore, 1995.
9. J. A. W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, Uni- versity of California, Los Angeles, Calif., 1968.
10. R. McNaughton and S. Papert. Counter-free Automata. MIT Press, 1971.
11. R. Meyer and A. Petit. Expressive completeness of LTrL on finite traces: an algebraic proof. In Proceedings of STACS’98, number 1373 in Lecture Notes in Computer Science, pages 533-543, 1998.
12. M. Mukund and P. S. Thiagarajan. Linear time temporal logics over Mazurkiewicz traces. In Proceedings of the 21th MFCS, 1996, number 1113 in Lecture Notes in Computer Science, pages 62-92. Springer, 1996.
13. P. Niebert. A ν-calculus with local views for sequential agents. In Proceedings of the 20th MFCS, 1995, number 969 in Lecture Notes in Computer Science, pages 563-573. Springer, 1995.
14. W. Penczek. Temporal logics for trace systems: On automated verification. International Journal of Foundations of Computer Science, 4:31-67, 1993.
15. W. Penczek and R. Kuiper. Traces and logic. In V. Diekert and G. Rozenberg,editors, The Book of Traces, chapter 10, pages 307-390. World Scientific, Singapore, 1995.
16. R. Ramanujam. Locally linear time temporal logic. In Proceedings of LICS’96, Lecture Notes in Computer Science, pages 118-128, 1996.
17. M. P. Schützenberger. On finite monoids having only trivial subgroups. Information and Control, 8:190-194, 1965.
18. A. Sistla and E. Clarke. The complexity of propositional linear time logic. J. ACM, 32:733-749, 1985.
19. P. S. Thiagarajan. A trace based extension of linear time temporal logic. In Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science (LICS’94), pages 438-447, 1994.
20. P. S. Thiagarajan. A trace consistent subset of PTL. In Proceedings of CON-CUR’95, number 962 in Lecture Notes in Computer Science, pages 438-452, 1995.
21. P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS’97), 1997.
22. I. Walukiewicz. Difficult configurations - on the complexity of LTrL. In Kim G. Larsen et al., editors, Proceedings of the 25th International Colloquium on Auto-mata, Languages and Programming (ICALP’98), Aalborg (Denmark) 1998, number 1443 in Lecture Notes in Computer Science, pages 140-151, Berlin-Heidelberg-New York, 1998. Springer.
23. Th. Wilke. Classifying discrete temporal properties. In Chr. Meinel and S. Ti-son, editors, Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS’99), Trier 1999, number 1443 in Lecture Notes in Computer Science, pages 32-46, Berlin-Heidelberg-New York, 1999. Springer. Invited Lecture.