Parallelisation of the petri net unfolding algorithm

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

Volumn 2280 LNCS, Issue , 2002, Pages 371-385

  Heljanko, Keijo ^a   Khomenko, Victor ^b   Koutny, Maciej ^b  

^a AALTO UNIVERSITY   (Finland)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Causality; Concurrency; Model checking; Parallel algorithms; Petri nets; Unfolding

Indexed keywords

PARALLEL ALGORITHMS; PETRI NETS;

CAUSALITY; CONCURRENCY; DEGREE OF PARALLELISM; EFFICIENT IMPLEMENTATION; PARALLELISATION; PETRI NET UNFOLDINGS; UNFOLDING;

MODEL CHECKING;

EID: 84888237129     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46002-0_26     Document Type: Conference Paper

References (20)

1. E. M. Clarke, E.A. Emerson and A.P. Sistla: Automatic Verification of Finite-state Concurrent Systems Using Temporal Logic Specifications. ACM TOPLAS 8 (1986) 244-263.
2. E. M. Clarke, O. Grumberg, and D. Peled: Model Checking. MIT Press (1999).
3. J.C. Corbett: Evaluating Deadlock Detection Methods. University of Hawaii at Manoa (1994).
4. J. Engelfriet: Branching processes of Petri Nets. Acta Informatica 28 (1991) 575-591.
5. J. Esparza and S. Römer: An Unfolding Algorithm for Synchronous Products of Transition Systems. Proc. of CONCUR'99, Springer-Verlag, Lecture Notes in Computer Science 1664 (1999) 2-20.
6. J. Esparza, S. Römer and W. Vogler: An Improvement of McMillan's Unfolding Algorithm. Proc. of TACAS'96, Margaria T., Steffen B. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1055 (1996) 87-106.
7. J. Esparza, S. Römer and W. Vogler: An Improvement of McMillan's Unfolding Algorithm. Formal Methods in System Design (2001) to appear.
8. J. Esparza and C. Schröter: Reachability Analysis Using Net Unfoldings. Proc. of Workshop of Concurrency, Specification & Programming 2000 (CS&P'2000), H. D. Burkhard, L. Czaja, A. Skowron, and P. Starke, (Eds.). Informatik-Bericht 140, Vol. 2. Humboldt-Universitat zu Berlin (2000) 255-270.
9. K. Heljanko: Minimizing Finite Complete Prefixes. Proc. of Workshop Concurrency, Specification and Programming 1999 (CS&P'99), (1999) 83-95.
10. K. Heljanko: Deadlock and Reachability Checking with Finite Complete Prefixes. Technical Report A56, Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland (1999).
11. K. Heljanko: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. Fundamentae Informaticae 37(3) (1999) 247-268.
12. K. Heljanko, V. Khomenko and M. Koutny: Parallelisation of the Petri Net Unfolding Algorithm. Technical Report CS-TR-733, Department of Computing Science, University of Newcastle (2001).
13. V. Khomenko and M. Koutny: Verification of Bounded Petri Nets Using Integer Programming. Technical Report CS-TR-711, Department of Computing Science, University of Newcastle (2000).
14. V. Khomenko and M. Koutny: LP Deadlock Checking Using Partial Order Dependencies. Proc. of CONCUR'2000, Palamidessi C. (Ed.). Springer-Verlag, Lecture Notes in Computer Science 1877 (2000) 410-425.
15. V. Khomenko and M. Koutny: An Efficient Algorithm for Unfolding Petri Nets. Technical Report CS-TR-726, Department of Computing Science, University of Newcastle (2001).
16. V. Khomenko and M. Koutny: Towards An Efficient Algorithm for Unfolding Petri Nets. Proc. of CONCUR'2001, Larsen P.G., Nielsen M. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 2154 (2001) 366-380.
17. K. L. McMillan: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. Proc. of 4th CAV, Springer-Verlag, Lecture Notes in Computer Science 663 (1992) 164-174.
18. K. L. McMillan: Symbolic Model Checking. PhD thesis, CMU-CS-92-131 (1992).
19. S. Melzer and S. Römer: Deadlock Checking Using Net Unfoldings. Proc. of Computer Aided Verification (CAV'97), O. Grumberg (Ed.). Springer-Verlag, Lecture Notes in Computer Science 1254 (1997) 352-363.
20. W. Vogler, V. Khomenko, and M. Koutny: Canonical Prefixes of Petri Net Unfoldings. Technical Report CS-TR-741, Department of Computing Science, University of Newcastle (2001).