Abstract
The paper develops a Petri net model of a negative feedback oscillator, Case 2a from Tyson et al. (Curr. Opin. Cell Biol. 15, 221–231, (2003), [48]), in order to be able to perform the holonomy decomposition of the automaton derived from its token markings and allowed transitions for a given initial state. The objective is to investigate the algebraic structure of the cascade product obtained from its holonomy components and to relate it to the behaviour of the physical system, in particular to the oscillations. The analysis is performed in two steps, first focusing on one of its component systems, the Goldbeter–Koshland ultrasensitive switch (Case 1c from Tyson et al. Curr. Opin. Cell Biol. 15, 221–231, (2003), [48]), in order to verify the validity of its differential model and, from this, to validate the corresponding Petri net through a stochastic simulation. The paper does not present new original results but, rather, discusses and critiques existing results from the different points of view of continuous and discrete mathematics and stochasticity. The style is one of a review paper or tutorial, specifically to make the material and the concepts accessible to a wide interdisciplinary audience. We find that the Case 2a model widely reported in the literature violates the assumptions of the Michaelis–Menten quasi-steady-state approximation. However, we are still able to show oscillations of the full rate equations and of the corresponding Petri net for a different set of parameters and initial conditions. We find that even the automata derived from very coarse Petri nets of Case 1c and Case 2a, with places of capacity 1, are able to capture meaningful biochemical information in the form of algebraic groups, in particular the reversibility of the phosphorylation reactions. Significantly, it appears that the algebraic structures uncovered by holonomy decomposition are a larger set than what may be relevant to a specific physical problem with specific initial conditions, although they are all physically possible. This highlights the role of physical context in helping select which algebraic structures to focus on when analysing particular problems. Finally, the interpretation of Petri nets as positional number systems provides an additional perspective on the computational properties of biological systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
- 3.
More precisely, if the capacity of the Petri net is 3, for example, meaning that each place can hold up to 3 tokens, then the base is \(3+1 = 4\) since the absence of tokens in a given place corresponds to a 0 digit for that place. So for a constant-capacity Petri net the base for this scheme is always given by the capacity \(+\)1.
- 4.
Either theorem shows that more than one cascade of machines can emulate the same automaton, i.e. the decomposition is not unique. Uniqueness up to isomorphism is only guaranteed in the analogous and immensely simpler case of the decomposition of finite groups, known as the Jordan–Hölder theorem of elementary finite group theory.
- 5.
A reset is a constant map from two or more states to a single state.
- 6.
The search for the right variables of a problem was vigorously pursued in the empirical discipline of hydraulics and hydrodynamics in the 19th Century, which led to method of similarity analysis which was then later shown to be a branch of group theory. In other words, looking for the right variables of a problem and looking for its symmetries are often one and the same problem.
- 7.
- 8.
Strictly speaking, for the QSS\(_2\) assumption, since both QSS and tQSS rely on the QSS\(_1\) assumption.
- 9.
Confusion may be caused by the use of ‘total’ in the name of this approximation to indicate only \(Y + [YX]\), whereas in (24.16) we used \(Y_T\) for all the species that involve Y in some way. The former is a subjective choice for the name of a variable that makes sense in reactions where the product is actually a different molecule rather than recognizably the same molecule in a phosphorylated state, as here.
- 10.
As expected, the same result is obtained by substituting \(Y_p + [Y_p Z]\) for \(\hat{Y}_p\) in (24.50).
- 11.
Or could mean inhibition if the dotted line ends with a flat segment instead of an arrow.
- 12.
Rather than a statement of biochemistry, this should be seen as a dynamical systems interpretation of the observed behaviour.
- 13.
A permutation-reset automaton is an automaton whose action is either a permutation of the state set or a constant map or reset (i.e. a map from the state set to a single state).
- 14.
This metaphor is due to Attila Egri-Nagy.
- 15.
Transformation semigroup elements composed of Petri net transitions are normally assumed to act on the left. This is done so that a string of transitions can be written and read from left to right.
References
Adami, C., Cerf, N.: Physical complexity of symbolic sequences. Phys. D 69, 137–162 (2000)
Adami, C., Ofria, C., Collier, T.: Evolution of biological complexity. Proc. Natl. Acad. Sci. 97(9), 4463–4468 (2000)
Alon, U.: An Introduction to Systems Biology: Design Principles of Biological Circuits. Chapman and Hall, Boca Raton (2007)
Börger, E., Stärk, R.: Abstract State Machines: A Method for High-Level System Design and Analysis. Springer, New York (2003)
Borghans, J.A.M., de Boer, R.J., Segel, L.A.: Extending the quasi-steady state approximation by changing variables. Bull. Math. Biol. 58(1), 43–63 (1996)
Brown, C.T., Rust, A.G., Clarke, P.J.C., Pan, Z., Schilstra, M.J., De Buysscher, T., Griffin, G., Wold, B.J., Cameron, R.A., Davidson, E.H., Bolouri, H.: New computational approaches for analysis of cis-regulatory networks. Dev. Biol. 246(1), 86–102 (2002)
Ciliberto, A., Capuani, F., Tyson, J.J.: Modeling networks of coupled enzymatic reactions using the total quasi-steady state approximation. PLoS Comput. Biol. 3(3), e45 (2007). http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.0030045
Dini, P., Nehaniv, C.L., Egri-Nagy, A., Schilstra, M.J.: Exploring the concept of interaction computing through the discrete algebraic analysis of the Belousov-Zhabotinsky reaction. BioSystems 112(2), 145–162 (2013)
Dini, P., Nehaniv, C.L., Schilstra, M.J., Karimi, F., Horváth, G., Muzsnay, Z., Christodoulides, K., Bonivárt, Á., den Breems, N.Y., Munro, A.J., Egri-Nagy, A.: D1.1.1: tractable dynamical and biological systems for numerical discrete, and lie group analysis. BIOMICS Deliverable, European Commission (2013). http://biomicsproject.eu/file-repository/category/11-public-files-deliverables
Dini, P., Rothstein, E.M., Schreckling, D., Nehaniv, C.L., Egri-Nagy, A.: D3.3.2: algebraic analysis of more complex computer science systems with specific security properties. BIOMICS Deliverable, European Commission (2014). http://biomicsproject.eu/file-repository/category/11-public-files-deliverables
Dini, P., den Breems, N.Y., Munro, A.J.: D1.1.2: ODE and automata analysis of cell metabolic and regulatory pathways. BIOMICS Deliverable, European Commission (2014). http://biomicsproject.eu/file-repository/category/11-public-files-deliverables
Egri-Nagy, A., Nehaniv, C.L.: PN2A: Petri Net Analysis GAP Package. http://sourceforge.net/projects/pn2a/
Egri-Nagy, A., Nehaniv, C.L.: Algebraic properties of automata associated to Petri nets and applications to computation in biological systems. BioSystems 94(1–2), 135–144 (2008)
Egri-Nagy, A., Nehaniv, C.L., Schilstra, M.J.: Symmetry groups in biological networks. In: Information Processing in Cells and Tissues, IPCAT09 Conference. Journal preprint, 5–9 April 2009
Egri-Nagy, A., Nehaniv, C.L., Mitchell, J.D.: SgpDec – Hierarchical Decompositions and Coordinate Systems, Version 0.7.29 (2014). http://sgpdec.sf.net
Félix, M.-A., Labbé, J.-C., Dorée, M., Hunt, T., Karsenti, E.: Triggering of cyclin degradation in interphase extracts of amphibian eggs by cdc2 kinase. Nature 346, 379–382 (1990)
Ferrel, J.E., Tsai, T.Y.-C., Yang, Q.: Modeling the cell cycle: why do certain circuits oscillate? Cell 144(3), 874–885 (2011)
Gibbings, J.C.: Dimensional Analysis. Springer, London (2011)
Gillespie, D.T.: A general method for numerically simulating the stochastic time evolution of coupled chemical reactions. J. Comput. Phys. 22, 403–434 (1976)
Gillespie, D.T.: Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81(25), 2340–2361 (1977)
Goldbeter, A.: A minimal cascade model for the mitotic oscillator involving cyclin and cdc2 kinase. Proc. Natl. Acad. Sci. 88, 9107–9111 (1991)
Goldbeter, A.: Biochemical Oscillations and Cellular Rhythms. Cambridge University Press, Cambridge (1996)
Goldbeter, A., Koshland, D.E.: An amplified sensitivity arising from covalent modification in biological systems. Proc. Natl. Acad. Sci. 78(11), 6840–6844 (1981)
Goldbeter, A., Koshland, D.E.: Sensitivity amplification in biochemical systems arising from covalent modification in biological systems. Q. Rev. Biophys. 15(3), 555–591 (1982)
Kauffman, S.: The Origins of Order: Self-Organisation and Selection in Evolution. Oxford University Press, Oxford (1993)
Konkoli, Z.: Application of Bogolyubov’s theory of weakly nonideal Bose gases to the AA, AB, BB reaction-diffusion system. Phys. Rev. E 69, 011106 (2004)
Konkoli, Z.: Diffusion-controlled reactions in small and structured spaces as a tool for describing living cell biochemistry. J. Phys.: Condens. Matter 19, 065149 (2007)
Konkoli, Z.: Modeling reaction noise with a desired accuracy by using the X-level approach reaction noise estimator(XARNES) method. J. Theor. Biol. 305, 1–14 (2012)
Konkoli, Z.: On the relevance of diffusion-controlled reactions for understanding living cell biochemistry. Int. J. Softw. Inf. 7(4), 675–694 (2013)
Konkoli, Z., Johannesson, H.: Two-species reaction-diffusion system with equal diffusion constants: anomalous density decay at large times. Phys. Rev. E 62(3), 3276–3280 (2000)
Krohn, K., Rhodes, J.: Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines. Trans. Am. Math. Soc. 116, 450–464 (1965)
Moran, J.: A unification of dimensional and similarity analysis via group theory. Ph.D. thesis, University of Wisconsin, Madison, WI (1967)
Nabli, F., Fages, F., Martinez, T., Soliman, S.: A boolean model for enumerating minimal siphons and traps in Petri nets. In: Proceedings of CP2012, 18th International Conference on Principles and Practice of Constraint Programming. LNCS, vol. 7514, pp. 798–814. Springer (2012)
Nehaniv, C.L.: Algebraic engineering of understanding: global hierarchical coordinates on computation for the manipulation of data, knowledge, and process. In: Proceedings of the 18th Annual International Computer Software and Applications Conference (COMPSAC94), pp. 418–425. IEEE Computer Society Press, Taipei, Taiwan (1994)
Nehaniv, C.L.: Algebraic models for understanding: coordinate systems and cognitive empowerment. In: Proceedings of the Second International Conference on Cognitive Technology. 1997: Humanizing the Information Age, pp. 147–162, Aizu-Wakamatsu City, Japan (1997)
Nehaniv, C.L., Rhodes, J.L.: The evolution and understanding of hierarchical complexity in biology from an algebraic perspective. Artif. Life 6, 45–67 (2000)
Nehaniv, C.L., Karimi, F., Rothstein, E., Dini, P.: D2.2: constrained realization of stable dynamical organizations, logic, and interaction machines. BIOMICS Deliverable, European Commission (2015). http://biomicsproject.eu/file-repository/category/11-public-files-deliverables
Nehaniv, C.L., Rhodes, J., Egri-Nagy, A., Dini, P., Rothstein Morris, E., Horváth, G., Karimi, F., Schreckling, D., Schilstra, M.J.: Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions. Philos. Trans. R. Soc. A 373, 20140223 (2015). http://dx.doi.org/10.1098/rsta.2014.0223
Novak, B., Tyson, J.J.: Design principles of biochemical oscillators. Nat. Rev.: Mol. Cell Biol. 9(12), 981–991 (2008)
Rhodes, J.: Applications of Automata Theory and Algebra via the Mathematical Theory of Complexity to Biology, Physics, Psychology, Philosophy, and Games. World Scientific Press (2010). Foreword by M.W. Hirsch, edited by C.L. Nehaniv (Original version: University of California at Berkeley, Mathematics Library, 1969)
Rothstein, E., Schreckling, D.: D4.1: candidate for a (co)algebraic interaction computing specification language. BIOMICS Deliverable, European Commission (2015). http://biomicsproject.eu/file-repository/category/11-public-files-deliverables
Rothstein, E.M., Dini, P., Nehaniv, C.L., Schreckling, D., Egri-Nagy, A.: D3.3.1: algebraic analysis of simple computer science systems. BIOMICS Deliverable, European Commission (2013). http://biomicsproject.eu/file-repository/category/11-public-files-deliverables
Rothstein Morris, E., Dini, P., Ruzsnavszky, F., Schreckling, D., Li, L., Munro, A.J., Börger, E.: D5.1: requirements collection for an interaction computing execution environment. BIOMICS deliverable, European Commission (2015). http://www.biomicsproject.eu
Schilstra, M.J., Martin, S.R.: Simple stochastic simulation. In: Michael, L., Ludwig, B. (eds.) Methods in Enzymology, pp. 381–409. Academic Press (Elsevier), New York (2009)
Schilstra, M.J., Martin, S.R., Keating, S.M.: Methods for simulating the dynamics of complex biological processes. In: Correia, J.J., Detrich, H.W. (eds.) Methods in Cell Biology, pp. 807–842. Elsevier, New York (2008)
Segel, L.A.: On the validity of the steady state assumption of enzyme kinetics. Bull. Math. Biol. 6, 579–593 (1988)
The GAP Group. Gap–Groups, Algorithms, and Programming, V 4.7.5 (2014). http://www.gap-system.org
Tyson, J.J., Chen, K.C., Novak, B.: Sniffers, buzzers, toggles and blinkers: dynamics of regulatory and signaling pathways in the cell. Curr. Opin. Cell Biol. 15, 221–231 (2003)
Tzafriri, A.R.: Michaelis-Menten kinetics at high enzyme concentrations. Bull. Math. Biol. 65, 1111–1129 (2003)
Wingender, E. (ed.): Biological Petri Nets. IOS Press, Amsterdam (2011) (Silver Anniversary Edition)
Zeiger, H.P.: Cascade synthesis of finite-state machines. Inf. Control 10(4), 419–433 (1967). Plus erratum
Acknowledgments
The author is grateful to Chrystopher L. Nehaniv and Attila Egri-Nagy for helpful discussions and for help with running SgpDec. The author is also grateful to Zoran Konkoli for discussions about the shortcomings of ODE models in the presence of low particle numbers and their generalizations based on stochastic methods, and to the TRUCE EU project that provided the context that enabled such discussions to take place. Finally, the author is grateful to Egon Börger for the many stimulating discussions about the similarities and differences between Petri nets and Abstract State Machines. The work reported in this article was funded by the BIOMICS EU project, contract number CNECT-ICT-318202. Its support is gratefully acknowledged.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Dini, P. (2017). Computational Properties of Cell Regulatory Pathways Through Petri Nets. In: Adamatzky, A. (eds) Advances in Unconventional Computing. Emergence, Complexity and Computation, vol 22. Springer, Cham. https://doi.org/10.1007/978-3-319-33924-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-33924-5_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33923-8
Online ISBN: 978-3-319-33924-5
eBook Packages: EngineeringEngineering (R0)