Skip to main content

Orthogonal transformations for coloured Petri nets

  • Regular Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1997 (ICATPN 1997)

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

Included in the following conference series:

Abstract

In this paper we describe a multirelational approach for performing linear algebraic manipulations of (coloured) Petri nets. In particular, we show how orthogonal transformations can be used in order to describe the net folding and unfolding operations.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Baumgarten: Petri-Netze. Grundlagen und Anwendungen. BI-Wissenschaftsverlag (1990).

    Google Scholar 

  2. E. Best: Semantics of Sequential and Parallel Programs. Prentice Hall International Series in Computer Science (1996).

    Google Scholar 

  3. E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel and E. Pelz: A Class of Composable High Level Petri Nets. Petri Net Conference'95, Torino, G. De Michelis, M. Diaz (eds). Springer-Verlag, Lecture Notes in Computer Science Vol. 935, 103–120 (1995).

    Google Scholar 

  4. K. Döpp: Bemerkungen über gefärbte Petrinetze. Petri Net Newsletter 47, Gesellschaft für Informatik, Bonn (1994).

    Google Scholar 

  5. H. Genrich: Predicate-transition Nets. Advances in Petri Nets 86, Part I, W. Brauer, W. Reisig and G. Rozenberg (eds). Springer-Verlag, Lecture Notes in Computer Science Vol. 254, 207–247 (1987).

    Google Scholar 

  6. K. Jensen: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1. EATCS Monographs on Theoretical Computer Science, Springer-Verlag (1992).

    Google Scholar 

  7. R.E. Kent: Introduction to Dialectical Nets. Proc. of 25th Annual Allerton Conference on Communication, Control and Computation. Univ. of Illinois, Monticello, 1204–1213 (1987).

    Google Scholar 

  8. W. Reisig: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Science Vol. 4, Springer-Verlag (1985).

    Google Scholar 

  9. W. Reisig: Petri Nets and Algebraic Specifications. Theoretical Computer Science Vol. 80, 1–34 (1991).

    Google Scholar 

  10. K. Schmidt: Symbolische Analysealgorithmen für algebraische Petrinetze. Dissertation (December 1995).

    Google Scholar 

  11. E. Smith and W. Reisig: The Semantics of a Net is a Net — an Exercise in General Net Theory. Concurrency and Nets. K. Voss, H.J. Genrich, G. Rozenberg (eds). Springer-Verlag, 461–480 (1987).

    Google Scholar 

  12. G. Stiege: Equivalences of Coloured Petri Nets. Hildesheimer Informatik-Berichte 24/96 (1996).

    Google Scholar 

  13. J. Vautherin: Parallel Systems Specification with Coloured Petri Nets and Algebraic Specifications. Advances in Petri Nets 87, G. Rozenberg (ed.). Springer-Verlag, Lecture Notes in Computer Science Vol. 266, 293–308 (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Pierre Azéma Gianfranco Balbo

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Best, E., Thielke, T. (1997). Orthogonal transformations for coloured Petri nets. In: Azéma, P., Balbo, G. (eds) Application and Theory of Petri Nets 1997. ICATPN 1997. Lecture Notes in Computer Science, vol 1248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63139-9_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-63139-9_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63139-2

  • Online ISBN: 978-3-540-69187-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics