Skip to main content
SpringerLink
Log in

Output Stability and Semilinear Sets in Chemical Reaction Networks and Deciders

  • Conference paper
DNA Computing and Molecular Programming (DNA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8727))

Included in the following conference series:

Abstract

We study the set of output stable configurations of chemical reaction deciders (CRDs). It turns out that CRDs with only bimolecular reactions (which are almost equivalent to population protocols) have a special structure that allows for an algorithm to efficiently calculate the (finite) set of minimal output stable configurations. As a consequence, a relatively large sequence of configurations may be efficiently checked for output stability.

We also provide a number of observations regarding the semilinearity result of Angluin et al. [Distrib. Comput., 2007] from the context of population protocols (which is a central result for output stable CRDs). In particular, we observe that the computation-friendly class of totally stable CRDs has equal expressive power as the larger class of output stable CRDs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing 18(4), 235–253 (2006)

    Article  MATH  Google Scholar 

  2. Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Ruppert, E., Malkhi, D. (eds.) Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC 2006), pp. 292–299. ACM (2006)

    Google Scholar 

  3. Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing 20(4), 279–304 (2007)

    Article  MATH  Google Scholar 

  4. Aspnes, J., Ruppert, E.: An introduction to population protocols. Bulletin of the EATCS 93, 98–117 (2007)

    MATH  MathSciNet  Google Scholar 

  5. Chen, H.-L., Doty, D., Soloveichik, D.: Deterministic function computation with chemical reaction networks. In: Stefanovic, D., Turberfield, A. (eds.) DNA 18. LNCS, vol. 7433, pp. 25–42. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Chen, H.-L., Doty, D., Soloveichik, D.: Rate-independent computation in continuous chemical reaction networks. In: Naor, M. (ed.) Innovations in Theoretical Computer Science (ITCS 2014), pp. 313–326. ACM (2014)

    Google Scholar 

  7. Cook, M., Soloveichik, D., Winfree, E., Bruck, J.: Programmability of chemical reaction networks. In: Condon, A., Harel, D., Kok, J.N., Salomaa, A., Winfree, E. (eds.) Algorithmic Bioprocesses. Natural Computing Series, pp. 543–584. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. American Journal of Mathematics 35, 413–422 (1913)

    Article  MATH  MathSciNet  Google Scholar 

  9. Doty, D.: Timing in chemical reaction networks. In: Chekuri, C. (ed.) Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp. 772–784. SIAM (2014)

    Google Scholar 

  10. Doty, D., Hajiaghayi, M.: Leaderless deterministic chemical reaction networks. In: Soloveichik, D., Yurke, B. (eds.) DNA 2013. LNCS, vol. 8141, pp. 46–60. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  11. Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and System Sciences 3(2), 147–195 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  12. Leroux, J.: Vector addition systems reachability problem (a simpler solution). In: Voronkov, A. (ed.) Proceedings of the Alan Turing Centenary Conference (Turing-100). EPiC Series, vol. 10, pp. 214–228 (2012)

    Google Scholar 

  13. Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC 1981), pp. 238–246. ACM, New York (1981)

    Google Scholar 

  14. Peterson, J.L.: Petri nets. ACM Computing Surveys 9(3), 223–252 (1977)

    Article  MATH  Google Scholar 

  15. Plotkin, G.D.: A calculus of chemical systems. In: Tannen, V., Wong, L., Libkin, L., Fan, W., Tan, W.-C., Fourman, M. (eds.) Buneman Festschrift 2013. LNCS, vol. 8000, pp. 445–465. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Soloveichik, D., Cook, M., Winfree, E., Bruck, J.: Computation with finite stochastic chemical reaction networks. Natural Computing 7(4), 615–633 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  17. Soloveichik, D., Seelig, G., Winfree, E.: DNA as a universal substrate for chemical kinetics. Proceedings of the National Academy of Sciences 107(12), 5393–5398 (2010)

    Article  Google Scholar 

  18. Stanley, R.P.: Enumerative Combinatorics, 2nd edn. Cambridge Studies in Advanced Mathematics, vol. 1. Cambridge University Press (2011)

    Google Scholar 

  19. Willard, D.E.: New data structures for orthogonal range queries. SIAM Journal on Computing 14(1), 232–253 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  20. Yamasaki, H.: On weak persistency of Petri nets. Information Processing Letters 13(3), 94–97 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hasselt University and Transnational University of Limburg, Belgium

    Robert Brijder

Authors
  1. Robert Brijder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Graduate School of Engineering, Department of Bioengineering and Robotics, Tohoku University, 6-6-01 Aoba-yama, 980-8579, Sendai, Japan

    Satoshi Murata

  2. Graduate School of Informatics and Engineering, Department of Communication Engineering and Informatics, University of Electro-Communications, 1-5-1 Chofugaoka, 182-8585, Chofu, Tokyo, Japan

    Satoshi Kobayashi

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Brijder, R. (2014). Output Stability and Semilinear Sets in Chemical Reaction Networks and Deciders. In: Murata, S., Kobayashi, S. (eds) DNA Computing and Molecular Programming. DNA 2014. Lecture Notes in Computer Science, vol 8727. Springer, Cham. https://doi.org/10.1007/978-3-319-11295-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11295-4_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11294-7

  • Online ISBN: 978-3-319-11295-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation