Linear time temporal logics over mazurkiewicz traces

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

Volumn 1113, Issue , 1996, Pages 63-92

  Mukund, Madhavan ^a   Thiagarajan, P S ^a  

^a Spic Science Foundation India   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DISTRIBUTED COMPUTER SYSTEMS; EQUIVALENCE CLASSES; MODEL CHECKING;

AUTOMATED VERIFICATION; DISTRIBUTED SYSTEMS; LINEAR TIME TEMPORAL LOGIC; MAZURKIEWICZ TRACES; MODEL CHECKING PROBLEM; PARTIAL ORDER; SATISFIABILITY;

TEMPORAL LOGIC;

EID: 0011156141     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_140     Document Type: Conference Paper

References (31)

1. A.V. AHO, J.E. HOPCROFT AND J.D. ULLMAN: The Design and Analysis of Algorithms, Addison-Wesley, Reading (1974).
2. R. ALUR, D. PELED AND W. PENCZEK: Model-Checking of Causality Properties, Proc. 10th IEEE LICS (1994).
3. V. DIEKERT: Combinatorics on traces, LNCS 454 (1990).
4. V. DIEKERT AND A. MUSCHOLL: Deterministic Asynchronous Automata for Infinite Traces, Acta Inf., 31 (1993) 379-397.
5. V. DIEKERT, G. ROZENBERG (Eds.): The Book of Traces, World Scientific, Singapore (1995).
6. W. EBINGER: Charakterisierunǵ von Sprachklassenunendlicher Spuren durch Logiken, Ph.D. Thesis, Institut für Informatik, Universität Stuttgart, Stuttgart, Germany (1994).
7. W. EBINGER AND A. MUSCHOLL: Logical Definability on Infinite Traces, Proc. ICALP '93, LNCS 700 (1993) 335-346.
8. P. GASTIN AND A. PETIT: Asynchronous Cellular Automata for Infinite Traces, Proc. ICALP '92, LNCS 623 (1992) 583-594.
9. P. GODEFROID AND P. WOLPER: A Partial Approach to Model Checking, Inform, and Comput., 110 (1994) 305-326.
10. M. HUHN: On Semantic and Logical Refinement of Actions, Technical Report, Institut für Informatik, Universität Hildesheim, Germany (1996).
11. S. KATZ AND D. PELED: Interleaving Set Temporal Logic, Theor. Comput. Sci., 75 (3) (1992) 21-43.
12. N. KLARLUND, M. MUKUND AND M. SOHONI: Determinizing Büchi asynchronous automata, Proc. FST&TCS 1995, LNCS 1026 (1995) 456-470.
13. K. LODAYA, R. PARIKH, R. RAMANUJAM AND P.S. THIAGARAJAN: A logical study of distributed transition systems, Inform, and Comput., 119 (1995) 91-118.
14. Z. MANNA AND A. PNUELI: The Temporal Logic of Reactive and Concurrent Systems (Specification), Springer-Verlag, Berlin (1991).
15. A. MAZURKIEWICZ: Concurrent Program Schemes and their Interpretations, Report DAIMI-PB-78, Computer Science Department, Aarhus University, Denmark (1978).
16. M. MUKUND AND M. SOHONI: Keeping track of the latest gossip: Bounded time-stamps suffice, Proc. FST&TCS '93, LNCS 761 (1993) 388-399.
17. A. MUSCHOLL: On the complementation of Büchi asynchronous cellular automata, Proc. ICALP '94, LNCS 820 (1994) 142-153.
18. K. NARAYAN KUMAR: An Improved Decision Procedure for TrPTL, Unpublished Manuscript, Tata Institute of Fundamental Research, Bombay, India (1994).
19. P. NiEBERT: A η-Calculus with Local Views for Systems of Sequential Agents, Proc. MFCS’95, LNCS 969 (1995) 563-573.
20. M. NIELSEN, G.D. PLOTKIN AND G. WINSKEL: Petri Nets, Event Structures and Domains I, Theor. Comput. Sci., 13 (1980) 86-108.
21. W. PENCZEK: Temporal Logics for Trace Systems: On Automated Verification, Int. J. Found, of Comput. Sci., 4(1) (1993) 31-68.
22. A. PNUELI: The Temporal Logic of Programs, Proc. 18th IEEE FOCS (1977) 46-57.
23. R. RAMANUJAM: Locally Linear Time Temporal Logic, To appear in Proc. 11th IEEE LICS (1996).
24. W. THOMAS: Automata on infinite objects, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Volume B, North-Holland, Amsterdam (1990) 133-191.
25. P.S. THIAGARAJAN: A Trace Based Extension of Linear Time Temporal Logic, Proc. 9th IEEE LICS (1994) 438-447. Full version available as: TrPTL: A Trace Based Extension of Linear Time Temporal Logic, Report TCS-93-6, School of Mathematics, SPIC Science Foundation, Madras, India (1993).
26. P.S. THIAGARAJAN: A Trace Consistent Subset of PTL, Proc. CONCUR’95, LNCS 962 (1995) 438-452. Full version available as: PTL over Product State Spaces, Report TCS-95-4, School of Mathematics, SPIC Science Foundation, Madras, India (1995).
27. A. VALMARI: Stubborn Sets for Reduced State Space Generation, LNCS 483 (1990) 491-515.
28. M. VARDJ, P. WOLPER: An automata theoretic approach to automatic program verification, Proc. 1st IEEE LICS (1986) 332-345.
29. G. WlNSKEL AND M. NIELSEN: Models for Concurrency, In: S. Abramsky and D. Gabbay (Eds.), Handbook of Logic in Computer Science, Vol 3, Oxford University Press, Oxford (1994).
30. W. ZlELONKA: Notes on finite asynchronous automata, R.A.I.R.O.-Inf. Théor. et Appl, 21 (1987) 99-135.
31. L. ZUCK: Past Temporal Logic, Ph.D. Thesis, Weizmann Institute, Rehovot, Israel (1986).