Pure future local temporal logics are expressively complete for Mazurkiewicz traces

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

Volumn 2976, Issue , 2004, Pages 232-241

  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

MODEL CHECKING; PROBLEM SOLVING; TEMPORAL LOGIC;

CONCURRENCY; LABELLED PARTIAL ORDER; MAZURKIEWICZ TRACES; MODEL CHECKING PROBLEM; SATISFIABILITY PROBLEMS; STANDING PROBLEMS;

FORMAL LOGIC;

EID: 35048897436     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_27     Document Type: Article

References (21)

1. B. Adsul and M. Sohoni. Complete and tractable local linear time temporal logics over traces. In Proc, of ICALP'02, number 2380 in LNCS, pages 926-937. Springer Verlag, 2002.
2. R. Alur, D. Peled, and W. Penczek. Model-checking of causality properties. In Proc. of LICS'95, pages 90-100, 1995.
3. V. Diekert. A pure future local temporal logic beyond cograph-monoids. In M. Ito, editor, Proc. of the RIMS Symposium on Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory, Kyoto, Japan 2002, 2002.
4. V. Diekert and P. Gastin. LTL is expressively complete for Mazurkiewicz traces. In Proc. of ICALP'00, number 1853 in LNCS, pages 211-222. Springer Verlag, 2000.
5. V. Diekert and P. Gastin. Local temporal logic is expressively complete for cograph dependence alphabets. In Proc. of LPAR'01, number 2250 in LNAI, pages 55-69. Springer Verlag, 2001.
6. V. Diekert and P. Gastin. LTL is expressively complete for Mazurkiewicz traces. Journal of Computer and System Sciences, 64:396-418, 2002.
7. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
8. W. Ebinger. Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken. Dissertation, Institut für Informatik, Universität Stuttgart, 1994.
9. W. Ebinger and A. Muscholl. Logical definability on infinite traces. Theoretical Computer Science, 154:67-84, 1996.
10. P. Gastin and D. Kuske. Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. In Proc. of CONCUR'03, number 2761 in LNCS, pages 222-236. Springer Verlag, 2003.
11. P. Gastin and M. Mukund. An elementary expressively complete temporal logic for Mazurkiewicz traces. In Proc. of ICALP'02, number 2380 in LNCS, pages 938-949. Springer Verlag, 2002.
12. P. Gastin, M. Mukund, and K. Narayan Kumar. Local LTL with past constants is expressively complete for Mazurkiewicz traces. In Proc. of MFCS'03, number 2747 in LNCS, pages 429-438. Springer Verlag, 2003.
13. J.A.W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, California, 1968.
14. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
15. M. Mukund and P.S. Thiagarajan. Linear time temporal logics over Mazurkiewicz traces. In Proc. of MFCS'96, number 1113 in LNCS, pages 62-92. Springer Verlag, 1996.
16. P. Niebert. A ν-calculus with local views for sequential agents. In Proc. of MFCS'95, number 969 in LNCS, pages 563-573. Springer Verlag, 1995.
17. W. Penczek. Temporal logics for trace systems: On automated verification. International Journal of Foundations of Computer Science, 4:31-67, 1993.
18. R. Ramanujam. Locally linear time temporal logic. In Proc. of LICS'96, pages 118-128, 1996.
19. P.S. Thiagarajan. A trace based extension of linear time temporal logic. In Proc. of LICS'94, pages 438-447. IEEE Computer Society Press, 1994.
20. P.S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proc. of LICS'97, pages 183-194, 1997.
21. I. Walukiewicz. Difficult configurations - on the complexity of LTrL. In Proc. of ICALP'98, number 1443 in LNCS, pages 140-151. Springer Verlag, 1998.