Verifying Chemical Reaction Network Implementations: A Bisimulation Approach

DOI10.1007/978-3-319-43994-5_8zbMath1423.68287OpenAlexW2511413624MaRDI QIDQ2835707

Robert F. Johnson, Qing Dong, Erik Winfree

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20190617-104717955

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Biochemistry, molecular biology (92C40) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Verifying chemical reaction network implementations: a bisimulation approach ⋮ Verifying chemical reaction network implementations: a pathway decomposition approach ⋮ Computing with chemical reaction networks: a tutorial

Uses Software

• Visual DSD

Cites Work

• Unnamed Item
• Unnamed Item
• Modular verification of chemical reaction network encodings via serializability analysis
• A simple population protocol for fast robust approximate majority
• The covering and boundedness problems for vector addition systems
• Relationships between nondeterministic and deterministic tape complexities
• Efficient Turing-Universal Computation with DNA Polymers
• Two-domain DNA strand displacement

This page was built for publication: Verifying Chemical Reaction Network Implementations: A Bisimulation Approach