Verifying polymer reaction networks using bisimulation
type: Item
instance of: scholarly article
title: Verifying polymer reaction networks using bisimulation
zbMATH Open document ID: 1460.68039
author: Robert F. Johnson
author: Erik Winfree
published in: Theoretical Computer Science
publication date: 2020-10-13T00:00:00Z
full work available at URL: CaltechAUTHORS:20201029-152451680
Mathematics Subject Classification ID: 68Q07
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 92C40
Mathematics Subject Classification ID: 92E20
zbMATH DE Number: 7260167
zbMATH Keywords: verification
zbMATH Keywords: molecular computing
zbMATH Keywords: bisimulation
zbMATH Keywords: chemical reaction networks
zbMATH Keywords: polymer reaction networks
zbMATH Keywords: DNA strand displacement
describes a project that uses: MedOlDatschgerl
describes a project that uses: Visual DSD
MaRDI profile type: Publication
OpenAlex ID: W3082532717
cites work: A Software Package for Chemically Inspired Graph Transformation
cites work: Stably computable predicates are semilinear
cites work: A simple population protocol for fast robust approximate majority
cites work: Term Rewriting and All That
cites work: Q4738295
cites work: Q4846257
cites work: Two-domain DNA strand displacement
cites work: Forward and Backward Bisimulations for Chemical Reaction Networks
cites work: Syntactic Markovian Bisimulation for Chemical Reaction Networks
cites work: Comparing chemical reaction networks: a categorical and algorithmic perspective
cites work: On the Computational Power of Biochemistry
cites work: Deterministic function computation with chemical reaction networks
cites work: Rate-independent computation in continuous chemical reaction networks
cites work: Leaderless deterministic chemical reaction networks
cites work: Strong Computability and Variants of the Uniform Halting Problem
cites work: Chemical implementation of neural networks and Turing machines.
cites work: On the equivalence, containment, and covering problems for the regular and context-free languages
cites work: Verifying chemical reaction network implementations: a bisimulation approach
cites work: Complexity of some problems in Petri nets
cites work: Parallel program schemata
cites work: Q4344149
cites work: Q4359461
cites work: Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems
cites work: Modular verification of chemical reaction network encodings via serializability analysis
cites work: Computer Studies of Turing Machine Problems
cites work: Recursive Unsolvability of a problem of Thue
cites work: Q3999090
cites work: Efficient Turing-Universal Computation with DNA Polymers
cites work: Parallel and Scalable Computation and Spatial Dynamics with DNA-Based Chemical Reaction Networks on a Surface
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: Verifying chemical reaction network implementations: a pathway decomposition approach
cites work: Computation with finite stochastic chemical reaction networks
cites work: Q4131648
cites work: Error-free stable computation with polymer-supplemented chemical reaction networks
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Implementation of Turing machine using DNA strand displacement
DOI: 10.1016/J.TCS.2020.08.007
description: scientific article; zbMATH DE number 7260167