Abstract
In this paper, we define branching processes and unfoldings of high-level Petri nets and propose an algorithm which builds finite and complete prefixes of such unfoldings. The advantage of our method is that it avoids a potentially expensive translation of a high-level Petri net into a low-level one. The approach is conservative as all the verification tools employing the traditional unfoldings can be reused with prefixes derived directly from high-level nets. We show that this is often better than the usual explicit construction of the intermediate low-level net.
Chapter PDF
References
E. Best, H. Fleischhack, W. Fraczak, R. Hopkins, H. Klaudel, and E. Pelz: A Class of Composable High Level Petri Nets. ICATPN’1995, LNCS 935 (1995) 103–120.
E. Best and B. Grahlmann: PEP — more than a Petri Net Tool. TACAS’96, LNCS 1055 (1996) 397–401.
A. Bystrov and A. Yakovlev: Asynchronous Circuit Synthesis by Direct Mapping: Interfacing to Environment. ASYNC’02, IEEE Comp. Soc. Press (2002) 127–136.
E. M. Clarke, O. Grumberg, and D. Peled: Model Checking. MIT Press (1999).
J.-M. Couvreur, S. Grivet, and Denis Poitrenaud: Unfolding of Products of Symmetrical Petri Nets. ICATPN’2001, LNCS 2075 (2001) 121–143.
J. Engelfriet: Branching processes of Petri Nets. Acta Inf. 28 (1991) 575–591.
J. Esparza and S. Römer: An Unfolding Algorithm for Synchronous Products of Transition Systems. CONCUR’99, LNCS 1664 (1999) 2–20.
J. Esparza, S. Römer and W. Vogler: An Improvement of McMillan’s Unfolding Algorithm. TACAS’96, LNCS 1055 (1996) 87–106. Full version: Formal Methods in System Design 20(3) (2002) 285-310.
H. Fleischhack, B. Grahlmann: A Petri Net Semantics for B(PN)2 with Procedures. PDSE’97, IEEE Computer Society Press (1997) 15–27.
K. Heljanko: Minimizing Finite Complete Prefixes. CS&P’99, Workshop Concurrency, Specification and Programming (1999) 83–95.
K. Heljanko: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. Fund. Inf. 37(3) (1999) 247–268.
K. Heljanko, V. Khomenko and M. Koutny: Parallelisation of the Petri Net Unfolding Algorithm. TACAS’02, LNCS 2280 (2002) 371–385.
K. Jensen: Colored Petri Nets. Basic Concepts, Analysis Methods and Practical Use. EATCS Monographs on Theoretical Computer Science (1992).
V. Khomenko and M. Koutny: LP Deadlock Checking Using Partial Order Dependencies. CONCUR’2000, LNCS 1877 (2000) 410–425.
V. Khomenko and M. Koutny: Towards An Efficient Algorithm for Unfolding Petri Nets. CONCUR’2001, LNCS 2154 (2001) 366–380.
V. Khomenko, M. Koutny, and V. Vogler: Canonical Prefixes of Petri Net Unfoldings. CAV’02, LNCS 2404 (2002) 582–595.
V. Khomenko and M. Koutny: Branching Processes of High-Level Petri Nets.Techn. Rep. CS-TR-763, Department of Computing Science, University of Newcastle (2002).
V. E. Kozura: Unfolding of Colored Petri Nets. Techn. Rep. 80, A. P. Ershov Institute of Informatics Systems (2000).
L. Lamport: A Fast Mutual Exclusion Algorithm. ACM Transactions on Computer Systems 5(1) (1987) 1–11.
K. L. McMillan: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. CAV’92, LNCS 663 (1992) 164–174.
K. L. McMillan: Symbolic Model Checking. PhD thesis, CMU-CS-92-131 (1992).
S. Römer: Entwicklung und Implementierung von Verifikationstechniken auf der Basis von Netzentfaltungen. PhD thesis, Technische Universitat Munchen (2000).
A. Semenov: Verification and Synthesis of Asynchronous Control Circuits Using Petri Net Unfolding. PhD Thesis, University of Newcastle upon Tyne (1997).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khomenko, V., Koutny, M. (2003). Branching Processes of High-Level Petri Nets. In: Garavel, H., Hatcliff, J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2003. Lecture Notes in Computer Science, vol 2619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36577-X_34
Download citation
DOI: https://doi.org/10.1007/3-540-36577-X_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00898-9
Online ISBN: 978-3-540-36577-8
eBook Packages: Springer Book Archive