Many-sorted high-level nets
J. Billington · 2003
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.>