Selected papers of the Second Workshop on Concurrency and compositionality
A calculus for cryptographic protocols
Information and Computation
Multisets and structural congruence of the pi-calculus with replication
Theoretical Computer Science
Journal of the ACM (JACM)
Anytime, anywhere: modal logics for mobile 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
ECOOP '94 Proceedings of the 8th European Conference on Object-Oriented Programming
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
The Decidability of Model Checking Mobile Ambients
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Hi-index | 0.00 |
The ambient calculus of Cardelli and Gordon is a process calculus for describing mobile computation where processes may reside within a hierarchy of locations, called ambients. The dynamic semantics of this calculus is presented in a chemical style that allows for a compact and simple formulation. In this semantics, an equivalence relation, called spatial congruence, is defined on the top of an unlabelled transition system. We show that it is decidable to check whether two ambient calculus processes are spatially congruent or not. This result is based on a natural and intuitive interpretation of ambient processes as edge-labelled unordered trees, which allows us to concentrate on the subtle interaction between two key operators of the ambient calculus, namely restriction, that accounts for the dynamic generation of new location names, and replication, used to encode recursion. The result of our study is the definition of an algorithm to decide spatial congruence and a definition of a normal form for processes that is useful in the proof of important equivalence laws.