Communications of the ACM
An overview of Manifold and its implementation
Concurrency: Practice and Experience
A syntactic approach to type soundness
Information and Computation
Discrete time process algebra: absolute time, relative time and parametric time
Fundamenta Informaticae
A process algebraic view of Linda coordination primitives
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A coordination language for mobile components
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Coordination models: a guided tour
Coordination of Internet agents
Models and technologies for the coordination of Internet agents: a survey
Coordination of Internet agents
Resource access control in systems of mobile agents
Information and Computation
Real-Time Coordination in Distributed Multimedia Systems
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Real-Time Behaviour of Asynchronous Agents
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The IWIM Model for Coordination of Concurrent Activities
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Proceedings of the 2005 ACM symposium on Applied computing
MoCha-pi, an exogenous coordination calculus based on mobile channels
Proceedings of the 2005 ACM symposium on Applied computing
Pattern matching over a dynamic network of tuple spaces
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Timers and proximities for mobile ambients
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
In this paper we present a new model for timed coordination of communicating distributed processes. The proposed model is an extension of the @p-calculus with locations, types, and timers. Types are used to express restricted access to distributed resources. Timers define timeouts for both communication channels and resources. We define the syntax of the model and its operational semantics and provide a few results regarding the typing system and the timers. A timed barbed bisimulation relation is defined to compare the processes. Coordination is given in two stages: by strategically assigning values to timers, and then by employing a set of additional coordination rules. The timed coordination aspects are given through a coordinator pair. It consists of a timers assigning function which can be changed dynamically, and a set of coordination rules. As an illustrating example, we relate our model with the channels of the Reo coordination model.