DocumentCode
306906
Title
Hierarchies of place/transition refinements in Petri nets
Author
Zuberek, W.M. ; Bluemke, I.
Author_Institution
Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. John´´s, Nfld., Canada
Volume
1
fYear
1996
fDate
18-21 Nov 1996
Firstpage
355
Abstract
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
Keywords
Petri nets; discrete event systems; manufacturing processes; Petri nets; complex net models; dynamic refinements; manufacturing cells; model analysis; place/transition refinements; static refinements; Application software; Computer networks; Computer science; Discrete event systems; Frequency; Multiprocessing systems; Petri nets; Pulp manufacturing; Refining; Virtual manufacturing;
fLanguage
English
Publisher
ieee
Conference_Titel
Emerging Technologies and Factory Automation, 1996. EFTA '96. Proceedings., 1996 IEEE Conference on
Conference_Location
Kauai, HI
Print_ISBN
0-7803-3685-2
Type
conf
DOI
10.1109/ETFA.1996.573319
Filename
573319
Link To Document