Abstract
In this paper, we first present theoretical results, helping to understand the unfolding algorithm presented in [6],[7]. We then propose a modification of this algorithm, which can be efficiently parallelised and admits a more efficient implementation. Our experiments demonstrate that the degree of parallelism is usually quite high and resulting algorithms potentially can achieve significant speedup comparing with the sequential case.
Chapter PDF
Similar content being viewed by others
References
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.
E. M. Clarke, O. Grumberg, and D. Peled: Model Checking. MIT Press (1999).
J. C. Corbett: Evaluating Deadlock Detection Methods. University of Hawaii at Manoa (1994).
J. Engelfriet: Branching processes of Petri Nets. Acta Informatica 28 (1991) 575–591.
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.
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.
J. Esparza, S. Römer and W. Vogler: An Improvement of McMillan’s Unfolding Algorithm. Formal Methods in System Design (2001) to appear.
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.
K. Heljanko: Minimizing Finite Complete Prefixes. Proc. of Workshop Concurrency, Specification and Programming 1999 (CS&P’99), (1999) 83–95.
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).
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.
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).
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).
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.
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).
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.
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.
K. L. McMillan: Symbolic Model Checking. PhD thesis, CMU-CS-92-131 (1992).
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.
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).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heljanko, K., Khomenko, V., Koutny, M. (2002). Parallelisation of the Petri Net Unfolding Algorithm. In: Katoen, JP., Stevens, P. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2002. Lecture Notes in Computer Science, vol 2280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46002-0_26
Download citation
DOI: https://doi.org/10.1007/3-540-46002-0_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43419-1
Online ISBN: 978-3-540-46002-2
eBook Packages: Springer Book Archive