Reachability Analysis in BioAmbients

DOI10.1016/j.entcs.2008.12.111zbMath1347.68275OpenAlexW1996757581MaRDI QIDQ5179433

Gianluigi Zavattaro

Publication date: 19 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.111

zbMATH Keywords

decidabilityreachability analysisambientstarget reachability

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Systems biology, networks (92C42)

Related Items (2)

Reachability problems in BioAmbients ⋮ Deciding reachability problems in Turing-complete fragments of Mobile Ambients

Cites Work

• Unnamed Item
• A calculus of mobile processes. II
• 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
• BioAmbients: an abstraction for biological compartments
• On Reachability and Spatial Reachability in Fragments of BioAmbients
• Programming Languages and Systems
• Theoretical Computer Science

This page was built for publication: Reachability Analysis in BioAmbients