Compositional high-level Petri net semantics of a parallel programming language with procedures

This paper exhibits the extension of a formal semantics of a parallel programming language, based on high-level Petri nets, in order to cope with procedures. The solution is based on refinement and synchronization operations of high-level Petri nets. It inherits thus properties of the Petri net model, in particular the coherence with elementary Petri nets on which verification techniques are based. Furthermore, the approach formalizes nicely the intuition behind procedures and their parameters, while in the absence of procedures, our definition and the existing semantics coincide.