DocumentCode
2652570
Title
Many-sorted high-level nets
Author
Billington, Jonathan
Author_Institution
Telecom Australia Res. Lab., Clayton North, Vic., Australia
fYear
1989
fDate
11-13 Dec 1989
Firstpage
166
Lastpage
179
Abstract
Many-sorted high-level nets (MHLNs) combine abstract data types and Petri nets within the same algebraic framework and include inhibitor arcs and place capacities. Many-sorted signatures are used to define inscriptions. MHLNs are defined at two different levels of abstraction. At an abstract level markings and capacities are defined by terms. This is suitable for specifying classes of systems. At the concrete level, a many-sorted algebra satisfying the signature is used for markings and capacities. Both abstract and concrete MHLNs can be given an interpolation in terms of colored Petri nets extended by place capacities and inhibitors, known as P-nets. A hierarchy of high-level nets, including many-sorted versions of predicate-transition (PrT) nets and algebraic nets, is developed and differences from their single-sorted versions are discussed
Keywords
Petri nets; data structures; P-nets; Petri nets; abstract data types; algebraic framework; algebraic nets; colored Petri nets; inhibitor arcs; many sorted high level nets; many-sorted algebra; many-sorted versions; place capacities; predicate-transition; Algebra; Australia; Concrete; Concurrent computing; Inhibitors; Laboratories; Performance analysis; Petri nets; Power system modeling; Telecommunications;
fLanguage
English
Publisher
ieee
Conference_Titel
Petri Nets and Performance Models, 1989. PNPM89., Proceedings of the Third International Workshop on
Conference_Location
Kyoto
Type
conf
DOI
10.1109/PNPM.1989.68550
Filename
68550
Link To Document