Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Composing Abstractions of Coloured Petri Nets

Charles LakosContact Information

(6)  Computer Science Department, University of Adelaide, Adelaide, SA, 5005, Australia
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


Contact Information Charles Lakos
Email: Charles.Lakos@adelaide.edu.au
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Referenced by
1 newer article

  1. Gomes, L. (2005) Structuring and Composability Issues in Petri Nets Modeling. IEEE Transactions on Industrial Informatics 1(2)
    [CrossRef]
Remote Address: 38.107.191.106 • Server: mpweb01
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)