Verifying polymer reaction networks using bisimulation
From MaRDI portal
Publication:2003997
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
Cites work
- scientific article; zbMATH DE number 48028 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1033559 (Why is no real title available?)
- scientific article; zbMATH DE number 1072534 (Why is no real title available?)
- scientific article; zbMATH DE number 2087495 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- A simple population protocol for fast robust approximate majority
- A software package for chemically inspired graph transformation
- Chemical implementation of neural networks and Turing machines.
- Comparing chemical reaction networks: a categorical and algorithmic perspective
- Complexity of some problems in Petri nets
- Computation with finite stochastic chemical reaction networks
- Computer Studies of Turing Machine Problems
- Deterministic function computation with chemical reaction networks
- Efficient Turing-universal computation with DNA polymers
- Error-free stable computation with polymer-supplemented chemical reaction networks
- Forward and backward bisimulations for chemical reaction networks
- Handbook of Graph Grammars and Computing by Graph Transformation
- Implementation of Turing machine using DNA strand displacement
- Leaderless deterministic chemical reaction networks
- Modelling, simulating and verifying Turing-powerful strand displacement systems
- Modular verification of chemical reaction network encodings via serializability analysis
- On the Computational Power of Biochemistry
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Parallel and scalable computation and spatial dynamics with DNA-based chemical reaction networks on a surface
- Parallel program schemata
- Rate-independent computation in continuous chemical reaction networks
- Recursive unsolvability of a problem of Thue
- Stably computable predicates are semilinear
- Strong Computability and Variants of the Uniform Halting Problem
- Syntactic Markovian bisimulation for chemical reaction networks
- Term Rewriting and All That
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Two-domain DNA strand displacement
- Verifying chemical reaction network implementations: a bisimulation approach
- Verifying chemical reaction network implementations: a pathway decomposition approach
Cited in
(10)- Molecular computing for Markov chains
- Reachability bounds for chemical reaction networks and strand displacement systems
- Reachability bounds for chemical reaction networks and strand displacement systems
- Verifying chemical reaction network implementations: a bisimulation approach
- Proving the absence of unbounded polymers in rule-based models
- Verifying chemical reaction network implementations: a bisimulation approach
- Population-induced phase transitions and the verification of chemical reaction networks
- Verifying chemical reaction network implementations: a pathway decomposition approach
- CRN++: molecular programming language
- Computing with chemical reaction networks: a tutorial
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)
