Expressive completeness of LTrL on finite traces: An algebraic proof

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

Volumn 1373 LNCS, Issue , 1998, Pages 533-543

  Meyer, Raphaël ^a   Petit, Antoine ^a  

^a CNRS   (France)

Author keywords

automata and formal languages; logic in computer science; theory of parallel and distributed computation

Indexed keywords

AUTOMATA AND FORMAL LANGUAGES; EXPRESSIVE POWER; FINITE SEQUENCE; FINITE TRACES; FIRST ORDER THEORIES; LOGIC IN COMPUTER SCIENCE; MAZURKIEWICZ TRACES; THEORY OF PARALLEL AND DISTRIBUTED COMPUTATION; WREATH PRODUCTS;

ALGEBRA; AUTOMATA THEORY; DISTRIBUTED COMPUTER SYSTEMS; FORMAL LANGUAGES;

TEMPORAL LOGIC;

EID: 78649886056     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028588     Document Type: Conference Paper

References (17)

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 yon Sprachklassen unendlicher Spuren durch Logiken. Dissertation, Institut für Informatik, Universität Stuttgart, 1994.
5. S. Eilenberg. Automata, Languages, and Machines, volume B. Academic Press, New York and London, 1976.
6. P. Godefroid. Partial-order methods for the verification of concurrent systems. In LNCS 1032, pages 176-185. Springer, 1996.
7. G. Guaiana, R. Meyer, A. Petit, and P. Weil. An extension of the wreath product principle to traces, to appear, 1997.
8. G. Guaiana, A. Restivo, and S. Salemi. On aperiodic trace languages. In Proceedings of STACS'91, number 480 in Lecture Notes in Computer Science, pages 76-88, 1991.
9. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
10. D. Peled. Partial-order reductions: model checking using representatives. In Proceedings of MFCS'96, number 1113 in Lecture Notes in Computer Science, pages 93-112, 1996.
11. A. Pnueli. The temporal logics of programs. In Proceedings of the18th IEEE FOCS, 1977, pages 46-57, 1977.
12. R. Ramanujam. Locally linear time temporal logic. In Proceedings of LICS'96, pages 118-128, 1996.
13. H. Straubing. The wreath product and its applications. In Proceedings of theLITP Spring School on Theoretical Computer Science (in LNCS vol. 386), pages 15-24, 1988.
14. 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.
15. P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for mazurkiewicz traces. In Proceedings of the12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), 1997.
16. W. Thomas. Automata on infinite objects. In J. v. Leeuwen, editor, Handbook of Theoretical Computer Science, pages 133-191. Elsevier Science Publishers, 1990.
17. A. Valmari. A stubborn attack on state explosion. In Formal Methods in System Design, pages 1:297-322, 1992.