Verifying polymer reaction networks using bisimulation
DOI10.1016/J.TCS.2020.08.007zbMATH Open1460.68039OpenAlexW3082532717MaRDI QIDQ2003997FDOQ2003997
Authors: 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
Recommendations
- Verifying chemical reaction network implementations: a bisimulation approach
- Verifying chemical reaction network implementations: a bisimulation approach
- Verifying chemical reaction network implementations: a pathway decomposition approach
- Modelling, simulating and verifying Turing-powerful strand displacement systems
- Reachability bounds for chemical reaction networks and strand displacement systems
verificationchemical reaction networksmolecular computingbisimulationDNA strand displacementpolymer reaction networks
Biochemistry, molecular biology (92C40) Specification and verification (program logics, model checking, etc.) (68Q60) Classical flows, reactions, etc. in chemistry (92E20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Title not available (Why is that?)
- Efficient Turing-universal computation with DNA polymers
- Parallel program schemata
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Computation with finite stochastic chemical reaction networks
- Verifying chemical reaction network implementations: a bisimulation approach
- Deterministic function computation with chemical reaction networks
- Chemical implementation of neural networks and Turing machines.
- Stably computable predicates are semilinear
- Title not available (Why is that?)
- Handbook of Graph Grammars and Computing by Graph Transformation
- Term Rewriting and All That
- Modular verification of chemical reaction network encodings via serializability analysis
- Parallel and Scalable Computation and Spatial Dynamics with DNA-Based Chemical Reaction Networks on a Surface
- Modelling, simulating and verifying Turing-powerful strand displacement systems
- A simple population protocol for fast robust approximate majority
- Title not available (Why is that?)
- Two-domain DNA strand displacement
- Recursive Unsolvability of a problem of Thue
- Title not available (Why is that?)
- Computer Studies of Turing Machine Problems
- Complexity of some problems in Petri nets
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Strong Computability and Variants of the Uniform Halting Problem
- On the Computational Power of Biochemistry
- Verifying chemical reaction network implementations: a pathway decomposition approach
- Syntactic Markovian Bisimulation for Chemical Reaction Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Implementation of Turing machine using DNA strand displacement
- Leaderless deterministic chemical reaction networks
- Error-free stable computation with polymer-supplemented chemical reaction networks
- Comparing chemical reaction networks: a categorical and algorithmic perspective
- Rate-independent computation in continuous chemical reaction networks
- A Software Package for Chemically Inspired Graph Transformation
- Forward and Backward Bisimulations for Chemical Reaction Networks
Cited In (2)
Uses Software
This page was built for publication: Verifying polymer reaction networks using bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003997)
