Petri nets: an introduction
Mathematical aspects of Petri nets (French)
Mathematical aspects of Petri nets (French)
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
Types for the ambient calculus
Information and Computation - IFIP TCS2000
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
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 Reachability and Spatial Reachability in Fragments of BioAmbients
Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability Analysis in BioAmbients
Electronic Notes in Theoretical Computer Science (ENTCS)
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
Deciding Reachability in Mobile Ambients with Name Restriction
Electronic Notes in Theoretical Computer Science (ENTCS)
The κ-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Deciding reachability problems in turing-complete fragments of mobile ambients
Mathematical Structures in Computer Science
Name creation vs. replication in Petri net systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
On the reachability problem in P systems with mobile membranes
WMC'07 Proceedings of the 8th international conference on Membrane computing
On the dynamics of PB systems with volatile 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
On the computational power of the mate/bud/drip brane calculus: interleaving vs. maximal parallelism
WMC'05 Proceedings of the 6th international conference on Membrane Computing
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
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
| Hi-index | 0.00 |
Mobile Ambients has been proposed by Cardelli and Gordon as a foundational calculus for mobile computing. Since its introduction, the computational strength as well as the decidability of properties have been investigated for several fragments and variants of the standard calculus. We tackle the problem of reachability and we characterize a public (i.e., restriction free) fragment for which it is decidable. This fragment is obtained by removing the open capability and restricting the use of replication to guarded processes. Quite surprisingly, this fragment has been shown to be Turing complete by Maffeis and Phillips.