Modular verification of chemical reaction network encodings via serializability analysis (Q288812): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): journals/tcs/LakinSP16, #quickstatements; #temporary_batch_1731475607626
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PRISM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PoplMark / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q37015209 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2251260883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Turing-Universal Computation with DNA Polymers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Function Computation with Chemical Reaction Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The serializability of concurrent database updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple population protocol for fast robust approximate majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-domain DNA strand displacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Verification of DNA Strand Displacement Networks via Serializability Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic model checking of complex biological pathways / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation with finite stochastic chemical reaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localized Hybridization Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel and Scalable Computation and Spatial Dynamics with DNA-Based Chemical Reaction Networks on a Surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Analysis of Large-Scale DNA Strand Displacement Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Walker Circuits: Computational Potential, Design, and Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4621150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/LakinSP16 / rank
 
Normal rank

Latest revision as of 06:30, 13 November 2024

scientific article
Language Label Description Also known as
English
Modular verification of chemical reaction network encodings via serializability analysis
scientific article

    Statements

    Modular verification of chemical reaction network encodings via serializability analysis (English)
    0 references
    0 references
    0 references
    0 references
    27 May 2016
    0 references
    chemical reaction networks
    0 references
    modular verification
    0 references
    serializability
    0 references
    DNA strand displacement
    0 references
    0 references
    0 references
    0 references

    Identifiers