Advertisement

Composing Abstractions of Coloured Petri Nets

  • Charles Lakos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1825)

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.

Keywords

Theory of High-Level Petri Nets Abstraction Refinement 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. Baumgarten Petri-Netze: Grundlagen und Anwendungen Wissenschaftsverlag (1990).Google Scholar
  2. [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. [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).Google Scholar
  4. [4]
    J. Desel and A. Merceron Vicinity Respecting Homomorphisms for Abstracting System Requirements Report 337, Universität Karlsruhe (1996).Google Scholar
  5. [5]
    A. Diller Z: An Introduction to Formal Methods 2nd edn., Wiley (1994).Google Scholar
  6. [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).Google Scholar
  7. [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).Google Scholar
  8. [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. [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. [10]
    K. Jensen, S. Christensen, P. Huber, and M. Holla Design/CPN™: A Reference Manual MetaSoftware Corporation (1992).Google Scholar
  11. [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. [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. [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. [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. [15]
    J. Meseguer and U. Montanari Petri Nets are Monoids Information and Computation, 88,2, pp 105–155 (1990).zbMATHCrossRefMathSciNetGoogle Scholar
  16. [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).Google Scholar
  17. [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. [18]
    G. Winskel Petri Nets, Algebras, Morphisms, and Compositionality Information and Computation, 72, pp 197–238 (1987).zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Charles Lakos
    • 1
  1. 1.Computer Science DepartmentUniversity of AdelaideAdelaideAustralia

Personalised recommendations