Communicating sequential processes
Communicating sequential processes
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
A process algebra for timed systems
Information and Computation
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
Controlling interference in ambients
Proceedings of the 27th 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
Theoretical Computer Science
Resource access control in systems of mobile agents
Information and Computation
Communication and Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
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
Mobility in computer science and in membrane systems
CMC'10 Proceedings of the 11th international conference on Membrane computing
Behavioural equivalences over migrating processes with timers
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
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
| Hi-index | 0.00 |
Ambient calculus is a calculus for mobile computing able to express local communications inside hierarchical domains. So far the timing properties have not been considered in the framework of mobile ambients. We add timers to capabilities and ambients, and provide an operational semantics of the new calculus. Certain results are related to the passage of time, and some new behavioural equivalences over timed mobile ambients are defined. Timeout for network communication (TTL) can be naturally modelled by the time constraints over capabilities and ambients. The new formalism can be used to describe network protocols; Simple Network Management Protocol (SNMP) may implement its own strategy for timeout and retransmission in TCP/IP.