Hierarchies of place/transition refinements in Petri nets

Zuberek, W. M. and Bluemke, Ilona (1996) Hierarchies of place/transition refinements in Petri nets. In: IEEE Conference on Emerging Technologies and Factory Automation. ETFA '96, 18-21 Nov. 1996, Kauai, HI, USA.

[img] [English] PDF - Submitted Version
Available under License Creative Commons Attribution Non-commercial.

Download (136kB)


Place and transition refinements provide a convenient method of structuring complex net models by replacing single elements (places and transitions) at a "higher-level" of abstraction with "lower-level", more detailed, subnets. The concepts of static and dynamic place/transition refinements are introduced. Dynamic refinements do not increase the size of the (refined) model because no "expansion" of the model is performed; instead, only a "logical" association of higher-level elements with lower-level subnets is maintained and used in model analysis. Multiple applications of place/transition refinements results in hierarchical net models. The paper formalizes the concept of hierarchies of refinements in Petri nets and shows simple applications of the hierarchical approach to modeling of manufacturing cells.

Item Type: Conference or Workshop Item (Paper)
URI: http://research.library.mun.ca/id/eprint/14685
Item ID: 14685
Department(s): Science, Faculty of > Computer Science
Date: November 1996
Date Type: Completion
Digital Object Identifier (DOI): https://doi.org/10.1109/ETFA.1996.573319
Related URLs:

Actions (login required)

View Item View Item


Downloads per month over the past year

View more statistics