On Reachability and Spatial Reachability in Fragments of BioAmbients

DOI10.1016/J.ENTCS.2007.05.008zbMath1277.68177OpenAlexW2068233489MaRDI QIDQ2864197

Giorgio Delzanno, Roberto Montagna

Publication date: 6 December 2013

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.2007.05.008

zbMATH Keywords

reachabilityterm rewritingbiological systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cell biology (92C37) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Systems biology, networks (92C42)

Related Items (3)

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

Cites Work

• Mobile ambients
• When ambients cannot be opened
• BioAmbients: an abstraction for biological compartments
• Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting
• Programming Languages and Systems
• Theoretical Computer Science
• Unnamed Item

This page was built for publication: On Reachability and Spatial Reachability in Fragments of BioAmbients