Reachability problems in BioAmbients
From MaRDI portal
Publication:418830
DOI10.1016/j.tcs.2011.12.056zbMath1238.68097MaRDI QIDQ418830
Giorgio Delzanno, Gianluigi Zavattaro
Publication date: 30 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.056
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
92B05: General biology and biomathematics
92C42: Systems biology, networks
Related Items
Cites Work
- On the verification of membrane systems with dynamic structure
- A calculus of mobile processes. II
- Mobile ambients
- On the computational strength of pure ambient calculi
- When ambients cannot be opened
- Formal molecular biology
- BioAmbients: an abstraction for biological compartments
- On Reachability and Spatial Reachability in Fragments of BioAmbients
- Turing Completeness Using Three Mobile Membranes
- Deciding reachability problems in Turing-complete fragments of Mobile Ambients
- Deciding Reachability in Mobile Ambients with Name Restriction
- Reachability Analysis in BioAmbients
- Programming Languages and Systems
- Theoretical Computer Science
- On the Reachability Problem in P Systems with Mobile Membranes
- Unnamed Item
- Unnamed Item
- Unnamed Item