Skip to main content
SpringerLink
Log in

Unfoldings of Coloured Petri Nets

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2244))

Abstract

In this paper the unfolding technique is applied to coloured Petri nets (CPN) [6][7]. The technique is formally described, the definition of a branching process of CPN is given. The existence of the maximal branching process and the important properties of CPN’s unfoldings are proven. A new approach consisting in combining unfolding technique with symmetry and equivalence speci.cations [7] is presented and the important properties of obtained unfoldings are proven. We require CPN to be finite, n-safe and containing only finite sets of colours.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Bieber, H. Fleischhack Model Checking of Time Petri Nets Based on Partial Order Semantics. Proc. CONCUR’99.— Berlin a.o.: Springer-Verlag, 210–225 (1999).

    Google Scholar 

  2. J.-M. Couvreur, S. Grivet, D. Poitrenaud: Designing an LTL Model-Checker Based on Unfolding Graphs. Lecture Notes in Computer Science, Vol.1825, 123–145 (2000).

    Google Scholar 

  3. J. Esparza: Model-Checking Using Net Unfoldings. Lecture Notes in Computer Science Vol.668, 613–628 (1993).

    Google Scholar 

  4. J. Esparza J, K. Heljanko: A New Unfolding Approach to LTL Model-Checking. Lecture Notes in Computer Science Vol.1853, 475–486 (2000).

    Google Scholar 

  5. J. Esparza, S. Romer, W. Vogler: An Improvement of McMillan’s Unfolding Algorithm Proc. TACAS’96.— Berlin a.o.: Springer-Verlag, pp. 87–106 (1997).

    Google Scholar 

  6. K. Jensen: Coloured Petri Nets. Vol. 1. Berlin a.o.: Springer, (1995).

    MATH  Google Scholar 

  7. K. Jensen: Coloured Petri Nets. Vol. 2. Berlin a.o.: Springer, (1995).

    MATH  Google Scholar 

  8. A. Kondratyev, M. Kishinevsky, A. Taubin, S. Ten: A Structural Approach for the Analysis of Petri Nets by Reduced Unfoldings. 17th Intern. Conf. on Application and Theory of Petri Nets, Osaka, June 1996. Berlin a.o.: Springer-Verlag, 346–365 (1996).

    Google Scholar 

  9. V.E. Kozura: Unfoldings of Coloured Petri Nets. Tech. Rep. N 80, Novosibirsk 34 pages (2000).

    Google Scholar 

  10. V.E. Kozura: Unfoldings of Timed Coloured Petri Nets. Tech. Rep. N 82, Novosibirsk 33 pages (2001).

    Google Scholar 

  11. S. Melzer, S. Romer: Deadlock Checking Using Net Unfoldings. Proc. of the Conf. on Computer Aided Verification (CAV’97), Haifa, pp. 352–363 (1997).

    Google Scholar 

  12. K.L. McMillan: Using Unfolding to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits. Lecture Notes in Computer Science Vol.663, 164–174 (1992).

    Google Scholar 

  13. A. Valmari: Stubborn Sets of Coloured Petri Nets. Proc. of the 12th Intern. Conf. On Application and Theory of Petri Nets.— Gjern, 102–121 (1991).

    Google Scholar 

  14. A. Valmari: The State Explosion Problem. Lecture Notes in Computer Science Vol.1491, 429–528 (1998).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Russian Academy of Sciences, Siberian Branch, A.P. Ershov Institute of Informatics Systems, 6, Lavrentjev ave., 630090, Novosibirsk, Russia

    Vitaly E. Kozura

Authors
  1. Vitaly E. Kozura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Informatics and Mathematical Modelling, Technical University of Denmark, Bldg.322, 106-108, Richard Petersens Plads, 2800, Lyngby, Denmark

    Dines Bjørner

  2. Computer Science Department, Technical University of Munich, Arcisstr.21, 80290, Munich, Germany

    Manfred Broy

  3. A.P.Ershov Institute of Informatics Systems, Acad.Lavrentjev ave.,6, 630090, Novosibirsk, Russia

    Alexandre V. Zamulin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kozura, V.E. (2001). Unfoldings of Coloured Petri Nets. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2001. Lecture Notes in Computer Science, vol 2244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45575-2_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-45575-2_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43075-9

  • Online ISBN: 978-3-540-45575-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation