Chemical Reaction Network Designs for Asynchronous Logic Circuits
From MaRDI portal
Publication:2835704
DOI10.1007/978-3-319-43994-5_5zbMath1451.68109OpenAlexW2517825401WikidataQ56981813 ScholiaQ56981813MaRDI QIDQ2835704
Luca Cardelli, Max Whitby, Marta Kwiatkowska
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:7ee6dbe5-9b96-4d5e-b6f6-470035dbe364
Switching theory, applications of Boolean algebras to circuits and networks (94C11) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (4)
Chemical reaction network designs for asynchronous logic circuits ⋮ Computing with chemical reaction networks: a tutorial ⋮ Unnamed Item ⋮ Multi-scale verification of distributed synchronisation
Uses Software
Cites Work
- Unnamed Item
- Deterministic function computation with chemical reaction networks
- A simple population protocol for fast robust approximate majority
- Computation with finite stochastic chemical reaction networks
- Approximation of probabilistic reachability for chemical reaction networks using the linear noise approximation
- Rate-independent computation in continuous chemical reaction networks
- DNA Walker Circuits: Computational Potential, Design, and Verification
This page was built for publication: Chemical Reaction Network Designs for Asynchronous Logic Circuits