Verifying polymer reaction networks using bisimulation
DOI10.1016/j.tcs.2020.08.007zbMath1460.68039OpenAlexW3082532717MaRDI QIDQ2003997
Robert F. Johnson, Erik Winfree
Publication date: 13 October 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20201029-152451680
verificationbisimulationmolecular computingchemical reaction networksDNA strand displacementpolymer reaction networks
Classical flows, reactions, etc. in chemistry (92E20) Biochemistry, molecular biology (92C40) Specification and verification (program logics, model checking, etc.) (68Q60) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic function computation with chemical reaction networks
- Modular verification of chemical reaction network encodings via serializability analysis
- A simple population protocol for fast robust approximate majority
- Computation with finite stochastic chemical reaction networks
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Complexity of some problems in Petri nets
- Implementation of Turing machine using DNA strand displacement
- Leaderless deterministic chemical reaction networks
- Error-free stable computation with polymer-supplemented chemical reaction networks
- Verifying chemical reaction network implementations: a bisimulation approach
- Comparing chemical reaction networks: a categorical and algorithmic perspective
- Verifying chemical reaction network implementations: a pathway decomposition approach
- Parallel program schemata
- Parallel and Scalable Computation and Spatial Dynamics with DNA-Based Chemical Reaction Networks on a Surface
- Rate-independent computation in continuous chemical reaction networks
- Efficient Turing-Universal Computation with DNA Polymers
- Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems
- A Software Package for Chemically Inspired Graph Transformation
- On the Computational Power of Biochemistry
- Chemical implementation of neural networks and Turing machines.
- Handbook of Graph Grammars and Computing by Graph Transformation
- Term Rewriting and All That
- Two-domain DNA strand displacement
- Recursive Unsolvability of a problem of Thue
- Stably computable predicates are semilinear
- Syntactic Markovian Bisimulation for Chemical Reaction Networks
- Forward and Backward Bisimulations for Chemical Reaction Networks
- Computer Studies of Turing Machine Problems
- Strong Computability and Variants of the Uniform Halting Problem
This page was built for publication: Verifying polymer reaction networks using bisimulation
