Petri nets: an introduction
Mathematical aspects of Petri nets (French)
Mathematical aspects of Petri nets (French)
Theoretical Computer Science
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
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
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
Deciding reachability in mobile ambients
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
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)
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
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
| Hi-index | 0.00 |
The decidability of reachability for pure public Mobile Ambients (i.e. without communication and restriction) has been recently investigated in [5], where a characterization of a maximal deacidable fragment is provided. A peculiar feature of such a fragment is the absence of the open capability for ambient dissolution. In this paper we analyse reachability in Boxed Ambients [2], the most relevant variant of Mobile Ambients in which the open capability is dropped and replaced by a sophisticated parent/child form of communication. The main novelties with respect to [5] are: (i) the definition of a more general notion of reachability (called target reachability); (ii) the proof of the decidability of target reachability for a richer calculus also comprising parent/child communication.