Deciding reachability problems in Turing-complete fragments of Mobile Ambients
From MaRDI portal
Publication:3655763
DOI10.1017/S0960129509990181zbMath1191.68433OpenAlexW2032182172MaRDI QIDQ3655763
Gianluigi Zavattaro, Nadia Busi
Publication date: 12 January 2010
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129509990181
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)
Related Items (2)
Reachability problems in BioAmbients ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding
Cites Work
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Persistence of vector replacement systems is decidable
- A calculus of mobile processes. I
- Mobile ambients
- On the computational strength of pure ambient calculi
- When ambients cannot be opened
- On the expressive power of movement and restriction in pure mobile ambients
- Formal molecular biology
- BioAmbients: an abstraction for biological compartments
- Parallel program schemata
- On Reachability and Spatial Reachability in Fragments of BioAmbients
- Anytime, anywhere
- Bisimulation congruences in safe ambients
- Reachability Analysis in BioAmbients
- Computability of Recursive Functions
This page was built for publication: Deciding reachability problems in Turing-complete fragments of Mobile Ambients
