Abstractions and partial order reductions for checking branching properties of time petri nets

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

Volumn 2075, Issue , 2001, Pages 323-342

  Penczek, Wojciech ^a   Półrola, Agata ^b  

^a POLISH ACADEMY OF SCIENCES   (Poland)

^b UNIVERSITY OF LODZ   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING;

BRANCHING TIME; PARTIAL ORDER REDUCTIONS; TIME PETRI NETS; TIME-FREE;

PETRI NETS;

EID: 84947224884     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45740-2_19     Document Type: Conference Paper

References (30)

1. R. Alur, C. Courcoubetis, and D. Dill, Model Checking for Real-Time Systems, Proc. of LICS'90, IEEE, 1990, pp. 414-425.
2. R. Alur and D. Dill, Automata for Modelling Real-Time Systems, Theoretical Computer Science 126(2) (1994), 183-236.
3. R. Alur, T. Feder, and T. Henzinger, The Benefits of Relaxing Punctuality, Journal of ACM 43(1) (1996), 116-146.
4. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu, Symbolic Model Checking without BDDs, Proc. of DAT'99, 1999.
5. M.C. Browne, E.M. Clarke, and O. Grumberg, Characterizing Finite Kripke Structures in Propositional Temporal Logic, Theoretical Computer Science 59 (1988), 115-131.
6. B. Berthomieu and M. Diaz, Modelling and Verification of Time Dependent Systems Using Time Petri Nets, IEEE Trans. on Software Eng. 17(3) (1991), 259-273.
7. J. Bengtsson, B. Jonsson, J. Lilius, and Y. Wang, Partial Order Reductions for Timed Systems, LNCS 1466 (1998), 485-500.
8. R. Bryant, Graph-based Algorithms for Boolean Function Manipulation, IEEE Transaction on Computers 35(8) (1986), 677-691.
9. D. Dams, O. Grumberg, and R. Gerth, Abstract Interpretation of Reactive Systems: Abstractions Preserving ACTL*, ECTL* and CTL*, Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET), North-Holland, 1994.
10. D. Dams, R. Gerth, B. Knaack, and R. Kuiper, Partial-Order Reduction Techniques for Real-Time Model Checking, Proc. of 3rd Int. Workshop on Formal Methods for Industrial Critical Systems, 1998, pp. 157-169.
11. D. Dill, Timing Assumptions and Verification of Finite State Concurrent Systems, LNCS 407 (1989), 197-212.
12. A. Emerson and A.P. Sistla, Symmetry and Model Checking, Formal Methods in System Design 7 (1996), 105-131.
13. U. Goltz, R. Kuiper, and W. Penczek, Propositional Temporal Logics and Equivalences, LNCS 630 (1992), 222-236.
14. R. Gerth, R. Kuiper, D. Peled, and W. Penczek, A Partial Order Reductions to Branching Time Logic Model Checking, Information and Computation 150 (1999), 132-152.
15. O. Grumberg and D.E. Long, Model Checking and Modular Verification, LNCS 527 (1991), 250-265.
16. G.J. Holzmann and D. Peled, An Improvement in Formal Verification, Proc. of FORTE'94, Formal Description Techniques, Chapman and Hall, 1994, pp. 197-211.
17. J. Lilius, Efficient State Space Search for Time Petri Nets, Proc. MFCS'98 Workshop on Concurrency, ENTCS, vol. 18, Springer-Verlag, 1999, p. 21.
18. M. Minea, Partial Order Reductions for Model Checking of Timed Automata, LNCS 1664 (1999), 431-446.
19. F. Pagani, Partial Orders and Verification of Real Time Systems, LNCS 1135 (1996), 327-346.
20. D. Peled, Partial Order Reduction: Linear and Branching Temporal Logics and Process Algebras, POMIV'96, Partial Order Methods in Verification, American Mathematical Society, DIMACS, 1996, pp. 79-88.
21. A. Pólrola, Generation of Reduced Abstract State Spaces for Time Petri Nets, Report ICS PAS (2001), to appear.
22. W. Penczek, M. Szreter, R. Gerth, and R. Kuiper, Improving Partial Order Reductions for Branching Time Properties, Fundamenta Informaticae 43 (2000), 245-267.
23. Ch. Rouff, editor, Proc. of Formal Approaches to Agent-Based Systems, Springer-Verlag, 2001, to appear.
24. P. Starke, Analyse von Petri-Netz-Modellen, Teubner Verlag, 1990.
25. A. Valmari, Stubborn Sets for Reduced State Space Generation, Proc. of the 10th International Conference on Application and Theory of Petri Nets, LNCS, vol. 483, Springer-Verlag, 1989, pp. 491-515.
26. A. Valmari, Stubborn Set Methods for Process Algebras, Proc. POMIV'96, Partial Order Methods in Verification, Americal Mathematical Society, 1996, pp. 213-222.
27. I.B. Virbitskaite and E.A. Pokozy, A Partial Order Method for the Verification of Time Petri Nets, LNCS 1684 (1999), 547-558.
28. P. Wolper and P. Godefroid, Partial-Order Methods for Temporal Verification, LNCS 715 (1993), 233-246.
29. T. Yoneda and H. Ryuba, CTL Model Checking of Time Petri Nets Using Geometric Regions, IEICE Trans. Inf. and Syst. 3 (1998), 1-10.
30. T. Yoneda and B.H. Schlingloff, Efficient Verification of Parallel Real-Time Systems, Formal Methods in System Design 11(2) (1997), 197-215.