LTL is expressively complete for Mazurkiewicz traces

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

Volumn 1853, Issue , 2000, Pages 211-223

  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

AUTOMATA THEORY; COMPUTER CIRCUITS;

CONCURRENCY; FIRST ORDER THEORIES; LINEAR TIME LOGIC; MAZURKIEWICZ TRACES;

TEMPORAL LOGIC;

EID: 84974539367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_18     Document Type: Conference Paper

References (18)

1. R. Alur, D. Peled, and W. Penczek. Model-checking of causality properties. In Proceedings of LICS'95, pages 90-100, 1995.
2. V. Diekert and P. Gastin. An expressively complete temporal logic without past tense operators for mazurkiewicz traces. In Proceedings of CSL'99, number 1683 in Lecture Notes in Computer Science, pages 188-203. Springer, 1999.
3. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
4. W. Ebinger. Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken. 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.
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 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.
8. J. A. W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, Calif., 1968.
9. 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.
10. 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.
11. P. Niebert. A v-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.
12. W. Penczek. Temporal logics for trace systems: On automated verification. International Journal of Foundations of Computer Science, 4:31-67, 1993.
13. 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.
14. R. Ramanujam. Locally linear time temporal logic. In Proceedings of LICS'96, Lecture Notes in Computer Science, pages 118-128, 1996.
15. P. S. Thiagarajan. A trace based extension of linear time temporal logic. In Proceedings of LICS'94, pages 438-447, 1994.
16. P. S. Thiagarajan. A trace consistent subset of PTL. In Proceedings of CONCUR' 95, number 962 in Lecture Notes in Computer Science, pages 438-452, 1995.
17. P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proceedings of LICS'97, 1997.
18. Th. Wilke. Classifying discrete temporal properties. In Proceedings of STACS'99, number 1563 in Lecture Notes in Computer Science, pages 32-46. Springer, 1999