<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-28T16:48:15Z</responseDate>
  <request identifier="26780" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:26780</identifier>
        <datestamp>2026-07-27T07:33:58Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Modularity of Signal Propagation Networks in the Thermodynamic Binding Network Model</dc:title>
          <dc:creator>Yilmaz, And Kaan Ata</dc:creator>
          <dc:creator>Soloveichik, David</dc:creator>
          <dc:subject>Thermodynamic Binding Networks</dc:subject>
          <dc:subject>Chemical Reaction Networks</dc:subject>
          <dc:subject>Modular Composition</dc:subject>
          <dc:subject>Verification</dc:subject>
          <dc:subject>Simulation</dc:subject>
          <dc:description>The Thermodynamic Binding Network (TBN) model provides an equilibrium-based abstraction for molecular systems, but proving correctness of large networks built from individually verified modules remains difficult because modules can interact through shared binding-site types. We develop a method for proving correctness of modular TBNs by reducing a composition of arbitrarily many modules to a fixed coarse-grained TBN, computing the Hilbert basis of the reduced system, and lifting the resulting entropy bounds and polymer characterizations back to the original network. We apply this method to reversible signal-propagation modules: For the previously studied module implementing A+B ⟷ C, we show that stable configurations of an arbitrary network of such modules have the intended local structure, implying that firing an individual module preserves global stability. Under certain restrictions on the reaction set, these networks faithfully simulate a class of reversible chemical reaction networks: every bounded-length CRN execution can be realized by a height-2 path between stable TBN configurations, and any two stable TBN configurations map to CRN states in the same stoichiometric compatibility class. We further show that the same proof strategy extends to a novel module implementing reactions with two reactants and products like A+B ⟷ C+D.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>And Kaan Ata Yilmaz and David Soloveichik</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 387, 32nd International Conference on DNA Computing and Molecular Programming (DNA 32) (2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.DNA.32.10</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-267809</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DNA.32.10</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
