For the most recent entries see the Petri Nets Newsletter.

General refinement for high level Petri nets.

Devillers, Raymond; Klaudel, Hanna; Riemann, Robert-Christoph

In: Lecture Notes in Computer Science, Vol. 1346: Foundations of Software Technology and Computer Science, pages 297-311. Springer-Verlag, 1997.

Abstract: The algebra of M-nets, a high-level class of labeled Petri nets, was introduced in the Petri net box calculus in order to cope with the size problem of the low-level nets, especially of applied as semantical domain for parallel programming languages. A general, unrestricted refinement operator, intended to represent the procedure call mechanism for concurrent calls, is introduced into the M-net calculus. Its coherence with the low-level refinements is shown, together with its main properties.

Keywords: M-nets, general refinements, high-level Petri nets.

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

Back to the Petri Nets Bibliography