Pure future local temporal logics are expressively complete for Mazurkiewicz traces

Information and Computation

Volumn 204, Issue 11, 2006, Pages 1597-1619

  Diekert, Volker ^a   Gastin, Paul ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b CNRS   (France)

Author keywords

Concurrency; Mazurkiewicz traces; Temporal logics

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; MODEL CHECKING; TEMPORAL LOGIC;

CONCURRENCY; FIRST ORDER; KAMP'S THEOREM; LOCAL INTERPRETATION; MAZURKIEWICZ TRACES; MODEL CHECKING PROBLEM; SATISFIABILITY PROBLEMS; STANDING PROBLEMS;

PROBLEM SOLVING;

EID: 84855190947     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.07.002     Document Type: Article

References (39)

1. B. Adsul, M. Sohoni, Complete and tractable local linear time temporal logics over traces, in: Proc. ICALP'02 number 2380 in LNCS, Springer, New York, 2002, pp. 926-937.
2. R. Alur, D. Peled, W. Penczek, Model-checking of causality properties, in: Proc. LICS'95, IEEE Computer Society Press, Silver Spring, MD, 1995, pp. 90-100.
3. J. Cohen, D. Perrin, J.-E. Pin, On the expressive power of temporal logic, J. Comput. Syst. Sci. 46(1993) 271-295.
4. V. Diekert, P. Gastin, LTL is expressively complete for Mazurkiewicz traces, J. Comput. Syst. Sci. 64(2002) 396-418 (Pubitemid 34599455)
5. A preliminary version appeared at ICALP'00, LNCS 1853, Springer, New York, pp. 211-222.
6. V. Diekert, P. Gastin, Safety and liveness properties for real traces and a direct translation from LTL to monoids, in: Formal and Natural Computing-Essays Dedicated to Grzegorz Rozenberg, number 2300 in LNCS, Springer, New York, 2002, pp. 26-38.
7. V. Diekert, P. Gastin, Local temporal logic is expressively complete for cograph dependence alphabets, Informat. Comput. 195(2004) 30-52
8. A preliminary version appeared at LPAR'01, LNAI 2250, Springer, New York, pp. 55-69.
9. V. Diekert, P. Gastin, Pure future local temporal logics are expressively complete for Mazurkiewicz traces, in: M. Farach-Colton (Ed.), Proc. LATIN'04, number 2976 in LNCS, Springer, New York, 2004, pp. 232-241.
10. V. Diekert, P. Gastin, From local to global temporal logics over Mazurkiewicz traces, Theor. Comput. Sci. 356 (1-2) (2006) 126-135, In honour of Professor Christian Choffrut on the occasion of his 60th birthday. (Pubitemid 43821220)
11. in: V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore, 1995.
12. W. Ebinger, Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken, Dissertation, Institut für Informatik, Universität Stuttgart, 1994.
13. W. Ebinger, A. Muscholl, Logical definability on infinite traces, Theor. Comput. Sci. 154(1996) 67-84. (Pubitemid 126411921)
14. A. Ferandez Lopez, M. I. Tocon Barroso, The local algebras of an associative algebra and their applications, in: J. C. Misra (Ed.), Applicable Mathematics in the Golden Age, Narosa, 2002, pp. 254-275.
15. D. Gabbay, A. Pnueli, S. Shelah, J. Stavi, On the temporal analysis of fairness, in: Proc. PoPL'80, Las Vegas, Nev., 1980, pp. 163-173.
16. P. Gastin, D. Kuske, Satisfiability and model checking for MSO-definable temporal logics are in PSPACE, in: Proc. CONCUR'03, number 2761 in LNCS, Springer, New York, 2003, pp. 222-236.
17. P. Gastin, M. Mukund, An elementary expressively complete temporal logic for Mazurkiewicz traces, in: Proc. ICALP'02, number 2380 in LNCS, Springer, New York, 2002, pp. 938-949.
18. P. Gastin, M. Mukund, K. Narayan Kumar, Local LTL with past constants is expressively complete for Mazurkiewicz traces, in: Proc. MFCS'03, number 2747 in LNCS, Springer, New York, 2003, pp. 429-438.
19. P. Gastin, A. Petit, Infinite traces, in: V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore, 1995, pp. 393-486, chapter 11.
20. J. A. W. Kamp, Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, California, 1968.
21. R. M. Keller, Parallel program schemata and maximal parallelism I. Fundamental results, J. Assoc. Comput. Mach. 20(3) (1973) 514-537.
22. M. Kufleitner, Logical Fragments for Mazurkiewicz Traces: Expressive Power and Algebraic Characterizations. Ph. D. thesis, Institut für Formale Methoden der Informatik, Universität Stuttgart, 2006.
23. K. Mayberg, Lectures on algebras and triple systems, Technical report, University of Virginia, Charlottesville, 1972.
24. A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
25. R. McNaughton, S. Papert, Counter-Free Automata, MIT Press, Cambridge, MA, 1971.
26. M. Mukund, P. S. Thiagarajan, Linear time temporal logics over Mazurkiewicz traces, in: Proc. MFCS'96, number 1113 in LNCS, Springer, New York, 1996, pp. 62-92. (Pubitemid 126117884)
27. P. Niebert, A v-calculus with local views for sequential agents, in: Proc. MFCS'95, number 969 in LNCS, Springer, New York, 1995, pp. 563-573.
28. W. Penczek, Temporal logics for trace systems: On automated verification, Intl. J. Foundation Comput. Sci. 4(1993) 31-67.
29. D. Perrin, Recent results on automata and infinite words, in: Proc. MFCS'84, number 176 in LNCS, Springer, New York, 1984, pp. 134-148.
30. D. Perrin, J.-E. Pin, First order logic and star-free sets, J. Comput. Syst. Sci. 32(1986) 393-406. (Pubitemid 16630741)
31. R. Ramanujam, Locally linear time temporal logic, in: Proc. LICS'96, 1996, pp. 118-128.
32. M.-P. Schützenberger, On finite monoids having only trivial subgroups, Inform. Control 8(1965) 190-194.
33. P. Tesson, D. Thérien, Diamonds are Forever: The Variety DA, in: Semigroups, Algorithms, Automata and Languages, Coimbra (Portugal) 2001, World Scientific, Singapore, 2002, pp. 475-500.
34. P. S. Thiagarajan, A trace based extension of linear time temporal logic, in: Proc. of LICS'94, IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 438-447.
35. P. S. Thiagarajan, I. Walukiewicz, An expressively complete linear time temporal logic for Mazurkiewicz traces, in: Proc. LICS'97, 1997, pp. 183-194.
36. W. Thomas, Star-free regular sets of ω-sequences, Inform. Control 42(1979) 148-156.
37. I. Walukiewicz, Difficult configurations-on the complexity of LTrL, in: Proc. ICALP'98, number 1443 in LNCS, Springer, New York, 1998, pp. 140-151.
38. I. Walukiewicz, Private communication, 2001.
39. Th. Wilke, Classifying discrete temporal properties, in: Proc. STACS'99, number 1563 in LNCS, Springer, New York, 1999, pp. 32-46.