Communicating sequential processes
Communicating sequential processes
A theory of processes with durational actions
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Timing and causality in process algebra
Acta Informatica
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Absolute versus relative time in process algebras
Information and Computation - Special issue on EXPRESS 1997
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
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Process theory based on bisimulation semantics
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Electronic Notes in Theoretical Computer Science (ENTCS)
Behaviour Equivalences in Timed Distributed π -Calculus
Software-Intensive Systems and New Computing Paradigms
Modelling and verification of timed interaction and migration
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Coordinating parallel mobile ambients to solve SAT problem in polynomial number of steps
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
A timed mobility semantics based on rewriting strategies
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
| Hi-index | 0.00 |
Mobile ambients calculus is a formalism for mobile computing able to express local communications inside ambients. Ambients mobility is controlled by capabilities: in, out, and open. We add timers to communication channels, capabilities and ambients, and use a typing system for communication. The passage of time is given by a discrete global time progress function. We prove that structural congruence and passage of time do not interfere with the typing system. Moreover, once well-typed, an ambient remains well-typed. A timed extension of the cab protocol illustrates how the new formalism is working.