Abstract

We present a process algebra where timeouts of interactions and adaptable migrations in a distributed environment with explicit locations can be defined. Timing constraints allow to control the interaction (communication) between co-located mobile processes, and a migration action with variable destination supports flexible movement from one location to another. We define an operational semantics, and outline a structural translation of the proposed process algebra into operationally equivalent finite high level timed Petri nets. The purpose of such a translation is twofold. First, it yields a formal semantics for timed interaction and migration which is both compositional and allows to deal directly with concurrency and causality. Second, it should facilitate the use of simulation and verification tools developed within the area of Petri nets.

Keywords

mobility, timers, process algebra, high-level Petri nets, compositional translation, behavioural consistency