A (Non-elementary) modular decision procedure for LTrL

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

Volumn 1450 LNCS, Issue , 1998, Pages 356-365

  Gastin, Paul ^a   Meyer, Raphaël ^b   Petit, Antoine ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b CNRS   (France)

Author keywords

Automata and formal languages; Logic in computer science; Model checking; Theory of parallel and distributed computation

Indexed keywords

AUTOMATA THEORY; COMPUTER CIRCUITS; FORMAL LANGUAGES; MODEL CHECKING; COMPUTATION THEORY;

AUTOMATA AND FORMAL LANGUAGES; DECISION PROCEDURE; DISTRIBUTED COMPUTATIONS; EXPRESSIVE POWER; FIRST ORDER THEORIES; LINEAR TIME; LOGIC IN COMPUTER SCIENCE; MAZURKIEWICZ TRACES;

TEMPORAL LOGIC;

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

References (19)

1. R. Alur, D. Peled, and W. Penczek. Model-checking of causality properties. In Proceedings of LICS'95, pages 90-100, 1995.
2. J.R. Büchi. Weak second-order arithmetic and finite automata. Z. Math Logik Grundlag. Math., 6:66-92, 1960.
3. C. Courcoubetis, M. Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties, formal Methods in System Design, 1:275-288, 1992.
4. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
5. W. Ebinger. Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken. Dissertation, Institut für Informatik, Universität Stuttgart, 1994.
6. P. Gastin, R. Meyer, and A. Petit. A (non-elementary) modular decision procedure for LTrL. Technical report, LSV, ENS de Cachan, June 1998.
7. P. Kelb, T. Margaria, M. Mendier, and C. Gsottberger. Mosel: a flexible toolset for monadic second-order logic. In Proceedings of CAV'97, LNCS 1254, 1997.
8. N. Klarlund. Mona & Pido: The logic-automaton connection in practice. In Proceedings of CSL'97, LNCS, 1998.
9. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
10. R. Meyer and A. Petit. Expressive completeness of LTrL on finite traces: an algebraic proof. In Proceedings of STACS'98, number 1373 in LNCS, pages 533-543, 1998.
11. D. Perrin and J. E. Pin. Infinite words. Technical report, LITP, Avril 1997.
12. A. Pnueli. The temporal logics of programs. In Proceedings of the 18th IEEE FOCS, 1977, pages 46-57, 1977.
13. R. Ramanujam. Locally linear time temporal logic. In Proceedings of LICS'96, pages 118-128, 1996.
14. S. Safra. On the complexity of w-automata. In Proceedings of the 29th annual IEEE Symp. on Foundations of Computer Science, pages 319-327, 1988.
15. A. Sistla and E. Clarke. The complexity of propositional linear time logic. J. ACM, 32:733-749, 1985.
16. L. Stockmeyer. The complexity of decision problems in automata theory and logic. PhD thesis, TR 133, M.I.T., Cambridge, 1974.
17. 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.
18. 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.
19. I. Walukiewicz. Difficult configurations - on the complexity of LTrL. In Proceedings of ICALP'98, 1998.