Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: Composing abstractions for coloured petri nets
Author: Lakos, C.
Citation: Proceedings of Application and Theory of Petri Nets (ICATPN) 2000, held in Aarhus, Denmark, June 26-30 2000 / M. Nielsen and D. Simpson (eds.): pp.323-342
Publisher: Springer-Verlag
Publisher Place: Berlin, Heidelberg
Issue Date: 2000
Series/Report no.: Lecture notes in computer science ; 1825/2000
ISBN: 3540676937
ISSN: 0302-9743
Conference Name: International Conference: Application and Theory of Petri Nets (21st : 2000 : Aarhus, Denmark)
Editor: Nielsen, M.
Simpson, D.
Statement of
Charles Lakos
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
Rights: Copyright Springer-Verlag Berlin Heidelberg 2000
DOI: 10.1007/3-540-44988-4_19
Appears in Collections:Aurora harvest 5
Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.