2019
DOI: 10.1016/j.tcs.2017.10.011
|View full text |Cite
|
Sign up to set email alerts
|

Verifying chemical reaction network implementations: A pathway decomposition approach

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
9
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
3

Relationship

4
5

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 22 publications
0
9
0
Order By: Relevance
“…The mechanism of DNA strand displacement has been used to create a variety of synthetic molecular systems including circuits, motors and triggered assembly of structures 1 . Software tools have been developed for designing and analysing DNA strand displacement systems, capable of generating nucleic acid sequences from well-defined structures and molecular interactions 2 3 , calculating the thermodynamic 2 4 5 and kinetic 6 properties of designed molecules, and evaluating if the behaviours of the molecular systems agree with the higher-level designs 3 7 8 9 10 11 . There also exist a few molecular compilers that can translate abstract functions such as a logic function to DNA strand displacement implementations without requiring an understanding of the molecular level details 12 13 .…”
mentioning
confidence: 99%
“…The mechanism of DNA strand displacement has been used to create a variety of synthetic molecular systems including circuits, motors and triggered assembly of structures 1 . Software tools have been developed for designing and analysing DNA strand displacement systems, capable of generating nucleic acid sequences from well-defined structures and molecular interactions 2 3 , calculating the thermodynamic 2 4 5 and kinetic 6 properties of designed molecules, and evaluating if the behaviours of the molecular systems agree with the higher-level designs 3 7 8 9 10 11 . There also exist a few molecular compilers that can translate abstract functions such as a logic function to DNA strand displacement implementations without requiring an understanding of the molecular level details 12 13 .…”
mentioning
confidence: 99%
“…Note that an implementation of an (abstract CRN) is a CRN as well, called an implementation CRN. Verification of correctness of an implementation CRN against an abstract CRN has been studied using the notion of pathway decomposition in [60] and using the notion of bisimulation in [42]. We also remark that the notion of correctness in general depends on the computational model that is assumed.…”
Section: Implementation: Dna Strand Displacementmentioning
confidence: 99%
“…For example, we might compare the abstract description of the DNA stack machine to its actual physical implementation [42], and wonder if the properties of a stack machine are preserved. An analogous problem came up in the finite CRN case, where verification methods (based on serializability analysis [34], pathway decomposition [46], and CRN bisimulation [27]) found subtle errors in some of the proposed CRN compilation schemes. Each of those methods has advantages and disadvantages relative to the others, but all are capable of proving relevant correspondences between the behavior of physical CRN implementations and the abstract CRNs, or pointing out implementations that fail to correspond to the abstract CRNs in important ways.…”
Section: Introductionmentioning
confidence: 99%