Abstract

In this paper, we propose a finite structural translation of possibly recursive pi-calculus terms into Petri nets. This is achieved by using high level nets together with an equivalence on markings in order to model entering into recursive calls, which do not need to be guarded.

Keywords

mobility, process algebra, pi-calculus, Petri nets, compositional translation, behavioural consistency