Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Resource access control in systems of mobile agents
Information and Computation
Using Ambients to Control Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Coordination by Timers for Channel-Based Anonymous Communications
Electronic Notes in Theoretical Computer Science (ENTCS)
Mobile ambients with timers and types
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Timers and proximities for mobile ambients
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Behaviour Equivalences in Timed Distributed π -Calculus
Software-Intensive Systems and New Computing Paradigms
| Hi-index | 0.00 |
Distributed @p-calculus and ambient calculus are extended with timers which may trigger timeout recovery processes. Timers provide a useful notion of relative time with respect to the interaction in a distributed system. The rather flat notion of space in timed distributed @p-calculus is improved by considering a hierarchical representation of space in timed mobile ambients. Some basic results are proven, making sound both formal approaches. An easily understood example is used for both extensions, showing how it is possible to describe a non-monotonic behaviour and use a decentralized control to coordinate the interacting components in time and space.