Petri nets: an introduction
A calculus of mobile processes, II
Information and Computation
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
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
Biochemical Tuple Spaces for Self-organising Coordination
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
The κ-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
On the verification of membrane systems with dynamic structure
Natural Computing: an international journal
Reachability problems in BioAmbients
Theoretical Computer Science
| Hi-index | 0.00 |
We rephrase results, previously proved by Busi and Zavattaro on Mobile Ambients, characterizing a fragment of BioAmbients -without restriction and merge- in which a generalized form of reachability turns out to be decidable.