From local to global temporal logics over Mazurkiewicz traces

Theoretical Computer Science

Volumn 356, Issue 1-2, 2006, Pages 126-135

  Diekert, Volker ^a   Gastin, Paul ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b CNRS   (France)

Author keywords

Concurrency; Mazurkiewicz traces; Temporal logics

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER CRIME; COMPUTER SCIENCE; CONCURRENT ENGINEERING; LOGIC PROGRAMMING;

CONCURRENCY; MAZURKIEWICZ TRACES; TEMPORAL LOGICS;

FORMAL LOGIC;

EID: 33744772971     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.01.035     Document Type: Article

References (27)

1. R. Alur, D. Peled, W. Penczek, Model-checking of causality properties, in: Proc. LICS'95, IEEE Computer Society Press, Silverspring, MD, 1995, pp. 90-100.
2. Ch. Choffrut, Free partially commutative monoids, Technical Report 86/20, LITP, Université Paris 7 (France), 1986.
3. Choffrut Ch. A remark on the representation of trace monoids. Semigroup Forum 40 (1990) 143-152
4. Choffrut Ch. On the starheight of some rational subsets closed under partial commutations. Inform. Comput. 106 (1993) 61-82
5. Choffrut Ch. Combinatorics in trace monoids I. In: Diekert V., and Rozenberg G. (Eds). The Book of Traces (1995), World Scientific, Singapore 71-82 (Chapter 3)
6. Ch. Choffrut, Ch. Duboc, A star-height problem in free monoids with partial commutations, in: T. Ottmann (Ed.), Proc. (ICALP'87), Lecture Notes in Computer Science, Vol. 267, Springer, Berlin, 1987, pp. 42-53.
7. Choffrut Ch., and Goldwurm M. Determinants and Möbius functions in trace monoids. Discrete Math. 194 (1999) 239-247
8. Choffrut Ch., and Guerra G. Logical definability of some rational trace languages. Math. Systems Theory 28 (1995) 397-420
9. Diekert V., and Gastin P. LTL is expressively complete for Mazurkiewicz traces. J. Comput. System Sci. 64 (2002) 396-418
10. V. Diekert, P. Gastin, Safety and liveness properties for real traces and a direct translation from LTL to monoids, in: W. Brauer, H. Ehrig, J. Karhumäki, A. Salomaa (Eds.), Formal and Natural Computing-Essays Dedicated to Grzegorz Rozenberg, Lecture Notes in Computer Science, Vol. 2300, Springer, Berlin, 2002, pp. 26-38.
11. V. Diekert, P. Gastin, Pure future local temporal logics are expressively complete for Mazurkiewicz traces, in: M. Farach-Colton (Ed.), Proc. LATIN'04, Lecture Notes in Computer Science, Vol. 2976, Springer, Berlin, 2004, pp. 232-241.
12. W. Ebinger, Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken, Dissertation, Institut für Informatik, Universität Stuttgart, 1994.
13. Ebinger W., and Muscholl A. Logical definability on infinite traces. Theoret. Comput. Sci. 154 (1996) 67-84
14. P. Gastin, D. Kuske, Satisfiability and model checking for MSO-definable temporal logics are in PSPACE, in: Proc. CONCUR'03, Lecture Notes in Computer Science, Vol. 2761, Springer, Berlin, 2003, pp. 222-236.
15. Guaiana G., Restivo A., and Salemi S. Star-free trace languages. Theoret. Comput. Sci. 97 (1992) 301-311
16. Keller R. Parallel program schemata and maximal parallelism I. Fundamental results. J. Assoc. Comput. Mach. 20 3 (1973) 514-537
17. A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Report PB 78, Aarhus University, Aarhus, 1977.
18. A. Mazurkiewicz, Trace theory, in: W. Brauer et al. (Eds.), Petri Nets, Applications and Relationship to other Models of Concurrency, Lecture Notes in Computer Science, Vol. 255, Springer, Berlin, 1987, pp. 279-324.
19. M. Mukund, P. Thiagarajan, Linear time temporal logics over Mazurkiewicz traces, in: Proc. MFCS'96, Lecture Notes in Computer Science, Vol. 1113, Springer, Berlin, 1996, pp. 62-92.
20. P. Niebert, A ν-calculus with local views for sequential agents, in: Proc. MFCS'95, Lecture Notes in Computer Science, Vol. 969, Springer, Berlin, 1995, pp. 563-573.
21. Penczek W. Temporal logics for trace systems: on automated verification. Internat. J. Foundations Comput. Sci. 4 (1993) 31-67
22. R. Ramanujam, Locally linear time temporal logic, in: Proc. LICS'96, 1996, pp. 118-128.
23. P.S. Thiagarajan, A trace based extension of linear time temporal logic, in: Proc. LICS'94, IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 438-447.
24. P.S. Thiagarajan, A trace consistent subset of PTL, in: Proc. CONCUR'95, Lecture Notes in Computer Science, Vol. 962, Springer, Berlin, 1995, pp. 438-452.
25. P.S. Thiagarajan, I. Walukiewicz, An expressively complete linear time temporal logic for Mazurkiewicz traces, in: Proc. LICS'97, 1997, pp. 183-194.
26. I. Walukiewicz, Difficult configurations-on the complexity of LTrL, in: Proc. ICALP'98, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998, pp. 140-151.
27. Walukiewicz I. Local logics for traces. J. Automat. Languages Combin. 7 2 (2002) 259-290