For the most recent entries see the Petri Nets Newsletter.

Composing Abstractions of Coloured Petri Nets.

Lakos, Charles

In: Nielsen, M.; Simpson, D.: Lecture Notes in Computer Science, Vol. 1825: 21st International Conference on Application and Theory of Petri Nets (ICATPN 2000), Aarhus, Denmark, June 2000, pages 323-345. Springer-Verlag, 2000.

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.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography