Communication and concurrency
Computability of Recursive Functions
Journal of the ACM (JACM)
Theoretical Computer Science
Proving termination with multiset orderings
Communications of the ACM
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
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)
Separability, Expressiveness, and Decidability in the Ambient Logic
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Using Ambients to Control Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Typing and Subtyping Mobility in Boxed Ambients
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Communication Interference in Mobile Boxed Ambients
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
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 expressiveness of pure safe 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
Computation: finite and infinite machines
Computation: finite and infinite machines
Communication and mobility control in boxed ambients
Information and Computation
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
Replication vs. recursive definitions in channel based calculi
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
Symmetric electoral systems for ambient calculi
Information and Computation
Reachability Analysis in BioAmbients
Electronic Notes in Theoretical Computer Science (ENTCS)
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 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
Reachability analysis in boxed ambients
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Reachability analysis of mobile ambients in fragments of AC term rewriting
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Reachability problems in BioAmbients
Theoretical Computer Science
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 |
Cardelli and Gordon's calculus of Mobile Ambients has attracted widespread interest as a model of mobile computation. The standard calculus is quite rich, with a variety of operators, together with capabilities for entering, leaving and dissolving ambients. The question arises of what is a minimal Turing-complete set of constructs. Previous work has established that Turing completeness can be achieved without using communication or restriction. We show that it can be achieved merely using movement capabilities (and not dissolution). We also show that certain smaller sets of constructs are either terminating or have decidable termination.