Skip to main content

Exploring Synthetic Mass Action Models

  • Conference paper
  • First Online:
Hybrid Systems Biology (HSB 2014)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 7699))

Included in the following conference series:

  • 338 Accesses

Abstract

In this work we propose a model that can be used to study the dynamics of mass action systems, systems consisting of a large number of individuals whose behavior is influenced by other individuals that they encounter. Our approach is rather synthetic and abstract, viewing each individual as a probabilistic automaton that can be in one of finitely many discrete states. We demonstrate the type of investigations that can be carried out on such a model using the Populus toolkit. In particular, we illustrate how sensitivity to initial spatial distribution can be observed in simulation.

This work was partially supported by the French ANR project Cadmidia and the NIH Grants K25 CA131558 and R01 GM104973. Part of the work done while the second author was visiting CNRS-VERIMAG. This paper is an extended version of [14].

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

Access this chapter

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 EPUB and 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

Notes

  1. 1.

    Actually bilinear if one assumes the probability of triple encounters to be zero, as is often done in Chemistry.

  2. 2.

    A probabilistic automaton [15] is a Markov chain with an input alphabet where each input symbol induces a different transition matrix. It is also known as a Markov Decision Process (MDP) in some circles.

  3. 3.

    We export the primed variable notation from program verification where x stands for x[t] and \(x'\) denotes \(x[t+1]\).

  4. 4.

    We write the algorithm using the normalized state notation x but the combinatorial calculation underlying the derivation of probabilities will be based on the particle count X.

References

  1. Andrews, S.S., Bray, D.: Stochastic simulation of chemical reactions with spatial resolution and single molecule detail. Phys. Biol. 1(3), 137 (2004)

    Article  Google Scholar 

  2. Ball, P.: Critical Mass: How One Thing Leads to Another. Macmillan, London (2004)

    Google Scholar 

  3. Bortolussi, L., Hillston, J.: Checking individual agent behaviours in markov population models by fluid approximation. In: Bernardo, M., de Vink, E., Di Pierro, A., Wiklicky, H. (eds.) SFM 2013. LNCS, vol. 7938, pp. 113–149. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Burrage, K., Burrage, P.M., Leier, A., Marquez-Lago, T., Nicolau Jr., D.V.: Stochastic simulation for spatial modelling of dynamic processes in a living cell. In: Koeppl, H., Setti, G., di Bernardo, M., Densmore, D. (eds.) Design and Analysis of Biomolecular Circuits, pp. 43–62. Springer, New York (2011)

    Chapter  Google Scholar 

  5. Cardelli, L.: Artificial biochemistry. In: Condon, A., Harel, D., Kok, J.N., Salomaa, A., Winfree, E. (eds.) Algorithmic Bioprocesses, pp. 429–462. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Gillespie, D.T.: Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81(25), 2340–2361 (1977)

    Article  Google Scholar 

  7. Gillespie, D.T.: Approximate accelerated stochastic simulation of chemically reacting systems. J. Chem. Phys. 115, 1716 (2001)

    Article  Google Scholar 

  8. Gillespie, D.T.: Stochastic simulation of chemical kinetics. Annu. Rev. Phys. Chem. 58, 35–55 (2007)

    Article  Google Scholar 

  9. Halász, A.M., Pryor, M.M., Wilson, B.S., Edwards, J.S.: Spatio-temporal modeling of membrane receptors (2015). under review

    Google Scholar 

  10. Julius, A.A., Halász, Á., Sakar, M.S., Rubin, H., Kumar, V., Pappas, G.J.: Stochastic modeling and control of biological systems: the Lactose regulation system of escherichia coli. IEEE Trans. Autom. Control 53, 51–65 (2008)

    Article  MathSciNet  Google Scholar 

  11. Le Boudec, J.-Y., McDonald, D., Mundinger, J.: A generic mean field convergence result for systems of interacting objects. In: QEST, IEEE, pp. 3–18 (2007)

    Google Scholar 

  12. Maler, O.: Control from computer science. Ann. Rev. Control 26(2), 175–187 (2002)

    Article  Google Scholar 

  13. Maler, O.: On under-determined dynamical systems. In: EMSOFT, pp. 89–96. ACM (2011)

    Google Scholar 

  14. Maler, O., Halász, A.M., Lebeltel, O., Maler, O.: Exploring the dynamics of mass action systems. EPTCS 125, 84–91 (2013)

    Article  Google Scholar 

  15. Paz, A.: Introduction to Probabilistic Automata. Academic Press, Orlando (1971)

    MATH  Google Scholar 

  16. Samoilov, M.S., Arkin, A.P.: Deviant effects in molecular reaction pathways. Nat. Biotechnol. 24(10), 1235–1240 (2006)

    Article  Google Scholar 

Download references

Acknowledgment

We thank Eric Fanchon for many useful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Oded Maler .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Maler, O., Halász, Á.M., Lebeltel, O., Maler, O. (2015). Exploring Synthetic Mass Action Models. In: Maler, O., Halász, Á., Dang, T., Piazza, C. (eds) Hybrid Systems Biology. HSB 2014. Lecture Notes in Computer Science(), vol 7699. Springer, Cham. https://doi.org/10.1007/978-3-319-27656-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27656-4_6

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics