Local temporal logic is expressively complete for cograph dependence alphabets

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

Volumn 2250, Issue , 2001, Pages 55-69

  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

ARTIFICIAL INTELLIGENCE; GRAPH THEORY; TEMPORAL LOGIC;

CONCURRENCY; FIRST ORDER LOGIC; LINEAR TEMPORAL LOGIC; LOCAL INTERPRETATION; MAZURKIEWICZ TRACES; PSPACE-COMPLETE; SATISFIABILITY PROBLEMS; SERIES-PARALLEL GRAPH;

FORMAL LOGIC;

EID: 84937428794     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_4     Document Type: Conference Paper

References (23)

1. R. Alur, D. Peled, and W. Penczek. Model-checking of causality properties. In Proceedingss of the Tenth IEEE Symposium on Logic in Computer Science (LICS'95), pages 90-100, 1995.
2. D. G. Corneil, H. Lerchs, and L. S. Burlingham. Complement reducible graphs. Discrete Applied Mathematics, 3:163-174, 1981.
3. V. Diekert and P. Gastin. LTL is expressively complete for Mazurkiewicz traces. In Proceedings of ICALP 2000, number 1853 in Lecture Notes in Computer Science, pages 211-222. Springer Verlag, 2000.
4. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
5. W. Ebinger and A. Muscholl. Logical definability on infinite traces. Theoretical Computer Science, 154:67-84, 1996.
6. W. Ebinger. Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken. Dissertation, Institut für Informatik, Universität Stuttgart, 1994.
7. 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.
8. J. G. Henriksen. An expressive extension of TLC. In Proceedings of ASIAN'99, number 1742 in Lecture Notes in Computer Science, pages 126-138. Springer Verlag, 1999.
9. J. G. Henriksen. Logic and Automata for Verification: Expressiveness and Decidability Issues. PhD thesis, Dept. of Comp. Sci., University of Aarhus, 2000.
10. T. Jiang and B. Ravikumar. A note on the space complexity of some decision problems fir finite automata. Information Processing Letters, 40:25-31, 1991.
11. J. A. W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, Calif., 1968.
12. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
13. 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 Verlag, 1996.
14. 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 Verlag, 1995.
15. W. Penczek. Temporal logics for trace systems: On automated verification. InternationalJournalof Foundations of Computer Science, 4:31-67, 1993.
16. R. Ramanujam. Locally linear time temporal logic. In Proceedings of LICS'96, Lecture Notes in Computer Science, pages 118-128, 1996.
17. P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proceedings of LICS'97, 1997.
18. P. S. Thiagarajan. A trace based extension of linear time temporal logic. In Proceedings of LICS'94, pages 438-447, 1994.
19. M. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, number 1043 in Lecture Notes in Computer Science, pages 238-266. Springer Verlag, 1996.
20. I. Walukiewicz. Difficult configurations - on the complexity of LTrL. In Proceedings of ICALP'98, number 1443 in Lecture Notes in Computer Science, pages 140-151. Springer Verlag, 1998.
21. I. Walukiewicz. Local logics for traces. Journalof Automata, Languages and Combinatorics, 2001. To appear.
22. I. Walukiewicz. Private communication, 2001.
23. Th. Wilke. Classifying discrete temporal properties. In Proceedings of STACS'99, number 1563 in Lecture Notes in Computer Science, pages 32-46. Springer Verlag, 1999.