A calculus of mobile processes, II
Information and Computation
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Finite-Control Mobile Ambients
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Separability, Expressiveness, and Decidability in the Ambient Logic
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
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
On the expressiveness of pure safe ambients
Mathematical Structures in Computer Science
Equational properties of mobile ambients
Mathematical Structures in Computer Science
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
When ambients cannot be opened
Theoretical Computer Science - Foundations of software science and computation structures
On the reachability problem in P systems with mobile membranes
WMC'07 Proceedings of the 8th international conference on Membrane computing
Reachability analysis in boxed ambients
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Deciding reachability in mobile ambients
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from which the capability open has been removed, in terms of the reachability problem of the reduction relation. Surprisingly, we show that even for this very restricted fragment, the reachability problem is not decidable. At a second step, for a slightly weaker reduction relation, we prove that reachability can be decided by reducing this problem to markings reachability for Petri nets. Finally, we show that the name-convergence problem as well as the model-checking problem turn out to be undecidable for both the original and the weaker reduction relation.