For the most recent entries see the Petri Nets Newsletter.

Many-Sorted High-Level Nets.

Billington, Jonathan

In: PNPM89. Proceedings of the Third International Workshop On Petri Nets and Performance Models, 1989, Kyoto, Japan, pages 166-179. Los Alamitos, CA, USA: IEEE Computer Society Press, 1990.

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. 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 interpretation in terms of Coloured 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 nets and Algebraic nets, is developed.

Keywords: many-sorted high-level net; abstract data type; extended coloured net; predicate/transition net.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography