A Petri Net Semantics of a Simple Process Algebra for Mobility

Abstract In this paper, we propose a structural translation of terms from a simple variant of the Klaim process algebra into behaviourally equivalent finite high level Petri nets. This yields a formal semantics for mobility allowing one to deal directly with concurrency and causality.

[1]  Rocco De Nicola,et al.  Mobile Distributed Programming in X-Klaim , 2005, SFM.

[2]  Diego Latella,et al.  Formal modeling and quantitative analysis of KLAIM-based mobile systems , 2005, SAC '05.

[3]  Hanna Klaudel,et al.  M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages , 1998, Acta Informatica.

[4]  Rocco De Nicola,et al.  KLAIM: A Kernel Language for Agents Interaction and Mobility , 1998, IEEE Trans. Software Eng..

[5]  Maciej Koutny,et al.  Petri Net Semantics of the Finite pi-calculus Terms , 2004, Fundam. Informaticae.

[6]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[7]  Maciej Koutny,et al.  Asynchronous Box Calculus , 2002, Fundam. Informaticae.

[8]  Luca Cardelli,et al.  Mobile Ambients , 1998, Foundations of Software Science and Computation Structure.

[9]  Emilio Tuosto,et al.  The Klaim Project: Theory and Practice , 2003, Global Computing.

[10]  Maciej Koutny,et al.  Petri Net Algebra , 2001, Monographs in Theoretical Computer Science An EATCS Series.

[11]  Søren Christensen,et al.  Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs , 1992, Application and Theory of Petri Nets.