Timed Mobility in process algebra and Petri nets

Abstract We present a process algebra called TiMo in which timeouts of interactions and adaptable migrations in a distributed environment with explicit locations can be specified. Timing constraints allow to control the communication between co-located mobile processes, and a migration action with variable destination supports flexible movement from one location to another. The model of time is based on local clocks rather than a global clock. We provide a structural translation of TiMo into behaviourally equivalent high level timed Petri nets. As a result, we obtain a formal net semantics for timed interaction and migration which is both structural and allows one to deal directly with concurrency and causality.

[1]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[2]  Jan A. Bergstra,et al.  Process theory based on bisimulation semantics , 1988, REX Workshop.

[3]  Flavio Corradini,et al.  Absolute versus relative time in process algebras , 1999, EXPRESS.

[4]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[5]  Gabriel Ciobanu,et al.  Mobile Ambients with Timers and Types , 2007, ICTAC.

[6]  Apostolos Niaouris,et al.  An Algebra of Petri Nets with Arc-Based Time Restrictions , 2004, ICTAC.

[7]  Maciej Koutny,et al.  A compositional Petri net translation of general π-calculus terms , 2008, Formal Aspects of Computing.

[8]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[9]  David Murphy,et al.  Timing and causality in process algebra , 1996, Acta Informatica.

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

[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.

[12]  Kurt Jensen High-Level Petri Nets , 1982, European Workshop on Applications and Theory of Petri Nets.

[13]  Maciej Koutny,et al.  A Petri Net Semantics of a Simple Process Algebra for Mobility , 2005, EXPRESS.

[14]  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.

[15]  Grzegorz Rozenberg,et al.  High-level Petri Nets: Theory And Application , 1991 .

[16]  Peter H. Starke Some properties of timed nets under the earliest firing rule , 1988, European Workshop on Applications and Theory in Petri Nets.

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

[18]  Flavio Corradini Absolute versus relative time in process algebras , 1997, EXPRESS.

[19]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[20]  Christian Johansen,et al.  Timers for Distributed Systems , 2006, Electron. Notes Theor. Comput. Sci..

[21]  Gabriel Ciobanu,et al.  Modelling and Verification of Timed Interaction and Migration , 2008, FASE.