An expressively complete linear time temporal logic for Mazurkiewicz traces

Information and Computation

Volumn 179, Issue 2, 2002, Pages 230-249

  Thiagarajan, P S ^a   Walukiewicz, I ^b  

^a CHENNAI MATHEMATICAL INSTITUTE   (India)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PROBLEM SOLVING; SET THEORY;

LINEAR TIME TEMPORAL LOGIC;

FORMAL LOGIC;

EID: 0037115156     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.2956     Document Type: Conference Paper

References (32)

1. Alur, R., Peled, D., and Penczek, W. (1995), Model-checking of causality properties, in "LICS '95," pp. 90-100.
2. Courcelle, B. (1995), private communication.
3. Diekert, V., and Rozenberg, G. (1995), "The Book of Traces," World Scientific, Singapore.
4. Ebbinghaus, H.-D., and Flum, J. (1995), "Finite Model Theory," Springer-Verlag, Berlin.
5. Ebinger, W. (1994), "Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken," Ph.D. thesis, Institut für Informatik, Universität Stuttgart.
6. Ebinger, W., and Muscholl, A. (1993), Logical definability on infinite traces, in "ICALP '93," Vol. 700, pp. 335-346.
7. Feferman, S., and Vaught, R. (1959), The first order properties of products of algebraic systems, Fund. Math. 47, 57-103.
8. Gabbay, A., Pnueli, A., Shelah, S., and Stavi, J. (1980), On the temporal analysis of fairness, in "7th Ann. ACM Symp. on Principles of Programming Languages," pp. 163-173.
9. Gabbay, D., Hodkinson, I., and Reynolds, M. (1994), "Temporal Logic: Mathematical Foundations and Computational Aspects," Vol. 1, Clarendon Press, Oxford.
10. Gastin, P., and Petit, A. (1992), Asynchronous cellurar automata for infinite traces, in "ICALP '92," Lecture Notes in Compute Science, Vol. 623, pp. 583-594.
11. Godefroid, P. (1996), "Partial-Order Methods for the Verification of Concurrent Systems," Lecture Notes in Computer Science Vol. 1032, Springer-Verlag, Berlin.
12. Holzmann, G.J. (1992), "Design and Validation of Computer Protocols," Software Series, Prentice Hall, Englewood Clifts, NJ.
13. Kamp, H. (1968), "Tense Logic and the Theory of Linear Order," Ph.D. thesis, University of California.
14. Katz, S., and Peled, D. (1987), Interleaving set temporal logic, Theoret. Comput. Sci. 75, 21-43.
15. Lodaya, K., Parikh, R., Ramanujam, R., and Thiagarajan, P.S. A logical study of distributed transition systems, Inform. Comput. 119, 91-118.
16. Mazurkiewicz, A. (1978), "Concurrent Program Schemes and Their Interpretations," Report DAIMI-PB-78, Computer Science Department, Ȧrhus University, Ȧrhus, Denmark.
17. Mukund, M., and Thiagarajan, P.S. (1996), Linear time temporal logics over traces, in "MFCS '96," Lecture Notes i Computer Science, Vol. 1113, pp. 62-92, Springer-Verlag, Berlin/New York.
18. Niebert, P. (1995), A ν-calculus with local views for sequential agents, in "MFCS '95," Lecture Notes in Computer Science, Vol. 969, pp. 563-573, Springer-Verlag, Berlin/New York.
19. Niebert, P. (1997), "A Temporal Logic for the Specification and Verification of Distributed Behaviour," Ph.D. thesis, University of Hildesheim, Hildesheim, Germany.
20. Peled, D. (1996), Partial order reduction: Model checking using representatives, in "MFCS '9," Lecture Notes in Computer Science, Vol. 1113, pp. 93-112, Springer-Verlag, Berlin/New York.
21. Peled, D., and Pnueli, A. (1994), Proving partial order properties, Theoret. Comput. Sci. 126, 143-182.
22. Peled, D., Wilke, T., and Wolper, P. (1996), An algorithmic approach for checking closure properties of ω-regular languages, in "CONCUR '96," Lecture Notes in Computer Science, Vol. 1119, pp. 596-610, Springer-Verlag, Berlin.
23. Pnueli, A. (1997), The temporal logic of programs, in "18th Symposium on Foundations of Computer Science," pp. 46-57.
24. Ramanujam, R. (1996), Locally linear time temporal logic, in "LICS '96," pp. 118-128.
25. Thiagarajan, P.S. (1994), A trace based extension of linear time temporal logic, in "LICS '94," pp. 438-447.
26. Thiagarajan, P.S. (1995), A trace consistent subset of PTL, in "CONCUR '95," Lecture Notes in Computer Science, Vol. 962, pp. 438-452, Springer-Verlag, Berlin.
27. Thomas, W. (1990), Automata on infinite objects, in "Handbook of Theoretical Computer Science Vol. B" (J. van Leeuven, Ed.), pp. 133-192, Elsevier, Amsterdam.
28. Thomas, W. (1990), On logical definability of trace languages, in "Workshop of the ESPRIT Basic Research Action No: 3166" (V. Dickert, Ed.), Report TUM - 19002, Technical University of Munich, pp. 172-182.
29. Walukiewicz, I. (1998), Difficult configurations-on the complexity of LTrL, in "ICALP '98," Lecture Notes in Computer Science, Vol. 1443, Springer-Verlag, Berlin/New York.
30. Winskel, G., and Nielsen, M. (1994), Models for concurrency, in "Handbook of Logic in Computer Science" (S. Abramsky and D. Gabby, Eds.), Vol. 3, Oxford Univ. Press, London.
31. Valmari, A. (1992), A stubborn attack on state explosion, Formal Methods in System Design 1, 297-322.
32. Zuck, L. (1986), "Past Temporal Logic," Ph.D. thesis, Weizmann Institute of Science, Israel.