Model-checking for a subclass of event structures

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

Volumn 1217, Issue , 1997, Pages 145-164

  Penczek, Wojciech ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISCRETE EVENT SIMULATION;

DISCRETE EVENTS; EVENT STRUCTURES; LINEAR COMPLEXITY; PARTIAL ORDER REDUCTIONS;

MODEL CHECKING;

EID: 84958746924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0035386     Document Type: Conference Paper

References (28)

1. R. Alur, D. Peled, and W. Penczek, Model-Checking of Causality Properties, Proc. of LICS’95, pp. 90-100, 1995
2. L. Bolc, A. Szalas, eds., Time and Logic: A Computational Approach, UCL Press Ltd., London, 1995.
3. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
4. J. Desei and J. Esparza, Free choice Petri Nets, Cambridge tracts in TCS 40, Cambridge University Press, 1995.
5. V. Diekert and G. Rozenberg, editors. Dook of Traces. World Scientific, Singapore. 1995.
6. E. A. Emerson. Temporal and Modal Logic. In J. van Leeuven, editor, Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics, The MIT Press Elsevier, pp. 995-1067, 1990.
7. R. Gerth, R. Kuiper, D. Peled, and W. Penczek, A partial order approach to branching time logic model checking, Proc. of the Israeli Conference on Theoretical Computer Science, IEEE Computer Society Press, pp. 130-139, 1995.
8. M. Huhn and P. Niebert, Towards automata for branching time and partial order, Proc. of CONCUR’96, LNCS 1119, pp. 611-626, 1996.
9. K. Lodaya and P. S. Thiagarajan, A modal logic for a subclass of event structures, LNCS 267, Springer-Verlag, pp. 290-303, 1987.
10. O. Lichtenstein, A. Pnueli, Checking that finite-state concurrent programs satisfy their linear specification. Proc. 11th ACM POPL, pp. 97-107, 1984.
11. K. L. McMillan, A technique of a state space search based on unfolding. Format Methods in System Design 6 (1), pp. 45-65, 1995.
12. A. Mazurkiewicz, Basic notions of trace theory, LNCS 354, pp. 285-363, 1988.
13. M. Mukund, P. S. Thiagarajan, An Axiomatization of Well Branching Prime Event Structures. Theoretical Computer Science 96, pp. 35-72, 1992.
14. M. Mukund and P. S. Thiagarajan, Linear time temporal logics over Mazurkiewicz traces, Proceedings of MFCS’96, LNCS 1113, pp. 62-92, 1996.
15. P. Niebert, A/J-calculus with local views for systems of sequential agents, Proc. of MFCS’95, LNCS 969, pp. 563-573, 1995.
16. M. Nielslen and G. Winskel, Trace structures and other models for concurrency, a chapter in [5].
17. D. Peled, Partial order reductions: model-checking using representatives, Proc. of MFCS’96, LNCS 1113, pp. 93-112, 1996.
18. D. Peled, A. Pnueli, Provine partial order properties. Theoretical Computer Science 126, 143-182, 1994.
19. W. Penczek, A temporal logic for event structures, Fundamenta Informaticae XI, pp. 297-326, 1988.
20. W. Penczek, A Temporal Logic for the Local Specification of Concurrent Systems. Information Processing IFIP-89, pp. 857-862, 1989.
21. W. Penczek, Temporal logics on trace systems: on automated verification, International Journal of Foundations of Computer Science, Vol. 4 No. 1, pp. 31-67, 1993.
22. W. Penczek, Branching time and partial order in temporal logics, chapter 4 in [2].
23. W. Penczek and R. Kuiper, "Traces and Logic", a chapter in [5]
24. S. Pinter and P. Wolper, A temporal logic for reasoning about partially ordered computations. Proc. 3rd ACM PODC, 28-37, 1984.
25. R. E. Tarjan, Depth first search and linear graph algorithms, SIAM Journal of Computing, 1(2), pp. 146-160, 1972.
26. P. S. Thiagarajan, A Trace Based Extension of Linear Time Temporal Logic. Proc. lOth IEEE LICS, pp. 438-447, 1994.
27. B. Vergauwen and J. Levi, A linear local model checking algorithm for CTL, Proc. of CONCUR’93, LNCS 715, pp. 447-461, 1993.
28. G. Winskel, Event structures, in: W. Brauer, W. Reisig, G. Rozenberg (eds.), Advances in Petri Nets 1986, LNCS 255, pp. 279-324, 1987.