Petri nets: an introduction
The mathematics of Petri nets
A calculus of mobile processes, I
Information and Computation
Computability of Recursive Functions
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
Theoretical Computer Science
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Types for the ambient calculus
Information and Computation - IFIP TCS2000
On Reduction Semantics for the Push and Pull Ambitent Calculus
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Theoretical Computer Science - Special issue: Computational systems biology
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
Computation: finite and infinite machines
Computation: finite and infinite machines
When ambients cannot be opened
Theoretical Computer Science - Foundations of software science and computation structures
On Reachability and Spatial Reachability in Fragments of BioAmbients
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Multiset rewriting: a semantic framework for concurrency with name binding
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Reachability problems in BioAmbients
Theoretical Computer Science
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
The calculus of Mobile Ambients was proposed by Cardelli and Gordon as a foundational calculus for mobile computing. Since its introduction, the computational strength and the decidability of properties have been investigated for several fragments and variants of the standard calculus. We consider the problem of reachability and characterise a public (that is, restriction-free) fragment for which it is decidable. This fragment is obtained by removing the open capability and restricting the application of the replication operator to guarded processes only. This decidability result may appear surprising in combination with the fact that the same fragment was shown to be Turing complete by Maffeis and Phillips. Finally, we extend our decidability result in two ways: we first prove the decidability of a more general property called target reachability (according to which the target of interest for the reachability analysis consists of a possibly infinite set of processes) and then show that our decidability results also hold for a more general calculus, which includes the sophisticated communication mechanisms of Boxed Ambients, which is the most relevant variant of Mobile Ambients without the open capability.