Formal semantics and verification of network-based biocomputation circuits

DOI10.1007/978-3-030-67067-2_21zbMath1472.68057OpenAlexW3121081585MaRDI QIDQ2234096

Michelle Aluf-Medina, Till Korten, Avraham Raviv, Hillel Kugler, Dan V. jun. Nicolau

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-67067-2_21

zbMATH Keywords

model checkingsatisfiabilityexact coverbiological computationsubset sum problemnetwork-based biocomputation

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Networks and circuits as models of computation; circuit complexity (68Q06) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (1)

Verification Modulo theories

Cites Work

• Unnamed Item
• Unnamed Item
• NuSMV: A new symbolic model checker
• Automated Design and Verification of Localized DNA Computation Circuits
• Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems
• DNA Walker Circuits: Computational Potential, Design, and Verification
• Functional Analysis of Large-Scale DNA Strand Displacement Circuits
• Theory and Applications of Satisfiability Testing

This page was built for publication: Formal semantics and verification of network-based biocomputation circuits