Skip to main content
SpringerLink
Log in

Composing Abstractions of Coloured Petri Nets

  • Conference paper
  • First Online:
Application and Theory of Petri Nets 2000 (ICATPN 2000)

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

Included in the following conference series:

Abstract

An earlier paper considered appropriate properties for abstract net components (or nodes) in the Coloured Petri Net formalism. This paper augments that earlier work in three main areas — it proposes general canonical forms for such node refinements, it identifies two other forms of refinement which will be used in concert with node refinement, and it considers the compositionality of these refinements. All of them maintain behavioural compatibility between refined and abstract nets, which is captured by the notion of a system morphism.

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. Baumgarten Petri-Netze: Grundlagen und Anwendungen Wissenschaftsverlag (1990).

    Google Scholar 

  2. L. Cardelli and J.C. Mitchell Operations on Records Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science 442, Springer Verlag (1989).

    Google Scholar 

  3. J. Desel and A. Merceron Vicinity Respecting Net Morphisms Advances in Petri Nets 1990, G. Rozenberg (ed.), Lecture Notes in Computer Science 483, pp 165–185, Springer-Verlag (1990).

    Chapter  Google Scholar 

  4. J. Desel and A. Merceron Vicinity Respecting Homomorphisms for Abstracting System Requirements Report 337, Universität Karlsruhe (1996).

    Google Scholar 

  5. A. Diller Z: An Introduction to Formal Methods 2nd edn., Wiley (1994).

    Google Scholar 

  6. R. Fehling A Concept of Hierarchical Petri Nets with Building Blocks Advances in Petri Nets 1993, G. Rozenberg (ed.), Lecture Notes in Computer Science, pp 148–168, Springer-Verlag (1993).

    Chapter  Google Scholar 

  7. H.J. Genrich A Dictionary of Some Basic Notions of Net Theory Net Theory and Applications, W. Brauer (ed.), Lecture Notes in Computer Science 84, pp 519–535, Springer-Verlag (1980).

    Chapter  Google Scholar 

  8. H.J. Genrich Predicate/Transition Nets Advances in Petri Nets 1986 — Part 1, W. Brauer, W. Reisig, and G. Rozenberg (eds.), Lecture Notes in Computer Science 254, Springer-Verlag (1987).

    Google Scholar 

  9. K. Jensen Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use — Volume 1: Basic Concepts EATCS Monographs in Computer Science, Vol. 26, Springer-Verlag (1992).

    Google Scholar 

  10. K. Jensen, S. Christensen, P. Huber, and M. Holla Design/CPN™: A Reference Manual MetaSoftware Corporation (1992).

    Google Scholar 

  11. C. Lakos and G. Lewis A Catalogue of Incremental Changes for Coloured Petri Nets Technical Report TR99-02, Department of Computer Science, University of Adelaide (1999).

    Google Scholar 

  12. C.A. Lakos On the Abstraction of Coloured Petri Nets Proceedings of 18th International Conference on the Application and Theory of Petri Nets, Lecture Notes in Computer Science 1248, pp 42–61, Toulouse, France, Springer-Verlag (1997).

    Google Scholar 

  13. C.A. Lakos The Compositionality of Abstraction for Coloured Petri Nets Technical Report TR99-01, Department of Computer Science, University of Adelaide (1999).

    Google Scholar 

  14. G. Lewis and C. Lakos Incremental Reachability Algorithms Technical Report TR99-1, Department of Electrical Engineering and Computer Science, University of Tasmania (1999).

    Google Scholar 

  15. J. Meseguer and U. Montanari Petri Nets are Monoids Information and Computation, 88,2, pp 105–155 (1990).

    Article  MathSciNet  Google Scholar 

  16. C.A. Petri Introduction to General Net Theory Net Theory and Applications, W. Brauer (ed.), Lecture Notes in Computer Science 84, pp 1–19, Springer-Verlag (1980).

    Chapter  Google Scholar 

  17. W. Reisig Petri Nets in Software Engineering Advances in Petri Nets 1986 — Part 2, W. Brauer, W. Reisig, and G. Rozenberg (eds.), Lecture Notes in Computer Science 255, pp 63–96, Springer-Verlag (1987).

    Google Scholar 

  18. G. Winskel Petri Nets, Algebras, Morphisms, and Compositionality Information and Computation, 72, pp 197–238 (1987).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Adelaide, Adelaide, SA, 5005, Australia

    Charles Lakos

Authors
  1. Charles Lakos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Aarhus, Ny Munkegade bldg 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

  2. University of Brighton, Watts Building Lewes Road, Brighton, East Sussex, BN2 4GJ, UK

    Dan Simpson

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lakos, C. (2000). Composing Abstractions of Coloured Petri Nets. In: Nielsen, M., Simpson, D. (eds) Application and Theory of Petri Nets 2000. ICATPN 2000. Lecture Notes in Computer Science, vol 1825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44988-4_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-44988-4_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67693-5

  • Online ISBN: 978-3-540-44988-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation