Communication and concurrency
A calculus of mobile processes, I
Information and Computation
Computability of Recursive Functions
Journal of the ACM (JACM)
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
Information and Computation
Well-structured transition systems everywhere!
Theoretical Computer Science
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
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
Computation: finite and infinite machines
Computation: finite and infinite machines
When ambients cannot be opened
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
Symmetric electoral systems for ambient calculi
Information and Computation
Comparing communication primitives via their relative expressive power
Information and Computation
Reachability Analysis in BioAmbients
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Deciding Reachability in Mobile Ambients with Name Restriction
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidable Fragments of a Higher Order Calculus with Locations
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Relative Expressive Power of Calculi for Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Expressiveness of Forwarding in Higher-Order Communication
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On the computational power of BlenX
Theoretical Computer Science
Deciding reachability problems in turing-complete fragments of mobile ambients
Mathematical Structures in Computer Science
On the expressiveness of interaction
Theoretical Computer Science
On recursion, replication and scope mechanisms in process calculi
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Reachability analysis in boxed ambients
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Deciding behavioural properties in brane calculi
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
On the computational power of brane calculi
Transactions on Computational Systems Biology VI
Deciding reachability in mobile ambients
ESOP'05 Proceedings of the 14th European conference on Programming Languages and 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 |
Pure mobile ambients is a process calculus suitable to focus on issues related to mobility, abstracting away from aspects concerning process communication. However, it incorporates name restriction (i.e. the (vn) binder) and ambient movement (i.e. the in and out capabilities) that can be seen as characteristics adapted, or directly borrowed, from the tradition of communication-based process calculi. For this reason, we retain that it is worth to investigate whether or not these features can be removed from pure mobile ambients without losing expressive power.To this aim, we consider two variants of pure mobile ambients which differ in the way infinite processes can be defined; the former exploits process replication, while the latter is more general and permits recursive process definition. We analyse whether or not the elimination of ambient movement and/or name restriction reduces the expressive power of these two calculi, using the decidability of process termination as a yardstick. We prove that name restriction can be removed from both calculi without reducing the expressive power. On the other hand, the elimination of both ambient movement and name restriction strictly reduces the expressive power of both calculi. As far as the elimination of only ambient movement is concerned, we prove an interesting discrimination result: process termination is undecidable under recursive process definition, while it turns out to be decidable under process replication.