Advertisement

On the abstraction of coloured Petri Nets

  • Charles Lakos
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1248)

Abstract

This paper considers the appropriate properties for abstract net components in the Coloured Petri Net formalism. In doing so, it attempts to maintain the duality between places and transitions which is so foundational to Petri Net theory. It also defines what it means to execute the net at an abstract level.

Keywords

Theory of High-Level Petri Nets Abstraction Duality 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. Battiston, A. Chizzoni, and F. de Cindio Inheritance and Concurrency in CLOWN Proceedings of Workshop on Object-Oriented Programming and Models of Concurrency, Torino, Italy (1995).Google Scholar
  2. [2]
    E. Battiston and F. de Cindio Class Orientation and Inheritance in Modular Algebraic Nets Proceedings of IEEE International Conference on Systems, Man and Cybernetics2, pp 717–723, Le Touquet, France, IEEE (1993).Google Scholar
  3. [3]
    E. Battiston, F. de Cindio, and G. Mauri OBJSA Nets: A Class of High-level Nets having Objects as Domains Advances in Petri Nets 1988, G. Rozenberg (ed.), Lecture Notes in Computer Science 340, pp 20–43, Springer-Verlag (1988).Google Scholar
  4. [4]
    O. Biberstein and D. Buchs Structured Algebraic Nets with Object-Orientation Proceedings of Workshop on Object-Oriented Programming and Models of Concurrency, Torino, Italy (1995).Google Scholar
  5. [5]
    D. Buchs and N. Guelfi CO-OPN: A Concurrent Object Oriented Petri Net Approach Proceedings of 12th International Conference on the Application and Theory of Petri Nets, Gjern, Denmark (1991).Google Scholar
  6. [6]
    D. Buchs and N. Guelfi Open Distributed Programming Using the Object Oriented Specification Formalism CO-OPN Proceedings of 5th International Conference on Putting into Practice Methods and Tools for Information System Design, Nantes (1992).Google Scholar
  7. [7]
    Y. Deng, S.K. Chang, J.C.A.d. Figueired, and A. Perkusich Integrating Software Engineering Methods and Petri Nets for the Specification and Prototyping of Complex Information Systems Proceedings of 14th International Conference on the Application and Theory of Petri Nets, Lecture Notes in Computer Science 691, pp 206–223, Chicago, Springer-Verlag (1993).Google Scholar
  8. [8]
    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
  9. [9]
    J. Desel and A. Merceron Vicinity Respecting Homomorphisms for Abstracting System Requirements Report 337, Universität Karlsruhe (1996).Google Scholar
  10. [10]
    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
  11. [11]
    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
  12. [12]
    P. Huber, K. Jensen, and R.M. Shapiro Hierarchies of Coloured Petri Nets Proceedings of 10th International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science 483, pp 313–341, Springer-Verlag (1990).Google Scholar
  13. [13]
    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
  14. [14]
    K. Jensen, S. Christensen, P. Huber, and M. Holla Design/CPNTM: A Reference Manual Meta Software Corporation (1992).Google Scholar
  15. [15]
    C. Lakos and S. Christensen A General Systematic Approach to Arc Extensions for Coloured Petri Nets Proceedings of 15th International Conference on the Application and Theory of Petri Nets, Lecture Notes in Computer Science 815, pp 338–357, Zaragoza, Springer-Verlag (1994).Google Scholar
  16. [16]
    C.A. Lakos The Consistent Use of Names and Polymorphism in the Definition of Object Petri Nets Proceedings of 17th International Conference on the Application and Theory of Petri Nets, Lecture Notes in Computer Science 1091, pp 380–399, Osaka, Japan, Springer-Verlag (1996).Google Scholar
  17. [17]
    C.A. Petri “Forgotten” Topics of Net Theory Advances in Petri Nets 1986 — Part 2, W. Brauer, W. Reisig, and G. Rozenberg (eds.), Lecture Notes in Computer Science 255, Springer-Verlag (1986).Google Scholar
  18. [18]
    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
  19. [19]
    G. Richter Netzmodelle für die Bürokommunikation Informatik-Spektrum, 6, pp 210–220 (1983).Google Scholar
  20. [20]
    G. Richter Netunodelle für die Bürokommunikation Informatik-Spektrum, 7, pp 29–41 (1984).Google Scholar
  21. [21]
    C. Sibertin-Blanc A Client-Server Protocol for the Composition of Petri Nets Proceedings of 14th International Conference on the Application and Theory of Petri Nets, Lecture Notes in Computer Science 691, pp 377–396, Chicago, Springer-Verlag (1993).Google Scholar
  22. [22]
    P.S. Thiagarajan Elementary Net Systems Advances in Petri Nets 1986, Part I, W. Brauer, W. Reisig, and G. Rozenberg (eds.), Lecture Notes in Computer Science 254, pp 26–59, Springer-Verlag (1987).Google Scholar
  23. [23]
    G. Winskel Petri Nets, Algebras, Morphisms, and Compositionality Information and Computation, 72, pp 197–238 (1987).CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

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

Personalised recommendations