A Petri Net Translation of p-Calculus Terms (2006)

Author(s): Devillers R, Klaudel H, Koutny M

    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.

      • Date: 20-24 November 2006
      • Conference Name: Theoretical Aspects of Computing: 3rd International Colloquium (ICTAC)
      • Volume: 4281
      • Pages: 138-152
      • Publisher: Springer
      • Publication type: Conference Proceedings (inc. abstract)
      • Bibliographic status: Published

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

      Staff

      Professor Maciej Koutny
      Professor of Computing Science