Lookup NU author(s): Professor Gabriel Ciobanu,
Professor Maciej Koutny
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
We introduce a process algebra with processes able to migrate between different explicit locations of a distributed environment defined by a number of distinct locations. We use timing constraints over local clocks to control migration and communication, together with local maximal concurrency in the way actions are executed. Two processes may communicate if they are present at the same location and, in addition, they have appropriate access permissions to communicate over a shared channel. Access permissions can be acquired or lost while moving from one location to another. Timing constraints coordinate and control both communication between processes and migration between locations. We completely characterize the situations in which a process is guaranteed to possess safe access permissions in all possible environments. In this way, one can design systems in which processes are not blocked (deadlocked) due to the lack of dynamically changing access permissions.
Author(s): Ciobanu G, Koutny M
Publication type: Article
Publication status: Published
Journal: The Computer Journal
Print publication date: 01/05/2015
Online publication date: 11/02/2014
ISSN (print): 0010-4620
ISSN (electronic): 1460-2067
Publisher: Oxford University Press
Altmetrics provided by Altmetric