Abstract
A long standing open problem in the theory of (Mazurkiewicz) traces has been the question whether LTL (Linear Time Logic) is expressively complete with respect to the first order theory. We solve this problem positively for finite and infinite traces and for the simplest temporal logic, which is based only on next and until modalities. Similar results were established previously, but they were all weaker, since they used additional past or future modalities. Another feature of our work is that our proof is direct and does not use any reduction to the word case.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, D. Peled, and W. Penczek. Model-checking of causality properties. In Proceedings of LICS’95, pages 90–100, 1995.
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.
V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
W. Ebinger. Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken. Dissertation, Institut für Informatik, Universität Stuttgart, 1994.
W. Ebinger and A. Muscholl. Logical definability on infinite traces. Theoretical Computer Science, 154:67–84, 1996.
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.
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.
J. A. W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, Calif., 1968.
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.
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.
P. Niebert. Ai-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.
W. Penczek. Temporal logics for trace systems: On automated verification. International Journal of Foundations of Computer Science, 4:31–67, 1993.
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.
R. Ramanujam. Locally linear time temporal logic. In Proceedings of LICS’96, Lecture Notes in Computer Science, pages 118–128, 1996.
P. S. Thiagarajan. A trace based extension of linear time temporal logic. In Proceedings of LICS’94, pages 438–447, 1994.
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.
P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proceedings of LICS’97, 1997.
Th. Wilke. Classifying discrete temporal properties. In Proceedings of STACS’99, number 1563 in Lecture Notes in Computer Science, pages 32–46. Springer, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diekert, V., Gastin, P. (2000). LTL Is Expressively Complete for Mazurkiewicz Traces. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_18
Download citation
DOI: https://doi.org/10.1007/3-540-45022-X_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67715-4
Online ISBN: 978-3-540-45022-1
eBook Packages: Springer Book Archive