Cycles and communicating classes in membrane systems and molecular dynamics

Abstract We are considering sequential membrane systems and molecular dynamics from the viewpoint of Markov chain theory. The configuration space of these systems (including the transitions) is a special kind of directed graph, called a pseudo-lattice digraph, which is closely related to the stoichiometric matrix. Taking advantage of the monoidal structure of this space, we introduce the algebraic notion of precycle. A precycle leads to the identification of cycles by means of the concept of defect, which is a set of geometric constraints on configuration space. Two efficient algorithms for evaluating precycles and defects are given: one is an algorithm due to Contejean and Devie, the other is a novel branch-and-bound tree search procedure. Cycles partition configuration space into equivalence classes, called the communicating classes. The structure of the communicating classes in the free regime–where all rules are enabled–is analyzed: testing for communication can be done efficiently. We show how to apply these ideas to a biological regulatory system.

[1]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[2]  B. Davey,et al.  Introduction to Lattices and Order: Appendix B: further reading , 2002 .

[3]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[4]  Michael Muskulus,et al.  First Steps Towards a Geometry of Computation , 2005 .

[5]  Jeroen S. van Zon,et al.  Simulating biochemical networks at the particle level and in time and space: Green's function reaction dynamics. , 2005, Physical review letters.

[6]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[7]  P. T. Wolde,et al.  Simulating biochemical networks at the particle level and in time and space: Green's function reaction dynamics. , 2005 .

[8]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[9]  Emanuel Sperner,et al.  Introduction to modern algebra and matrix theory , 1951 .

[10]  J. Bauer,et al.  Chemical reaction network theory for in-silico biologists , 2003 .

[11]  Evelyne Contejean,et al.  An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations , 1994, Inf. Comput..

[12]  W. Ebeling.  Stochastic Processes in Physics and Chemistry , 1995 .

[13]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[14]  B. M. Schmitt,et al.  The Concept of “Buffering” in Systems and Control Theory: From Metaphor to Math , 2004, Chembiochem : a European journal of chemical biology.

[15]  Peter Buchholz,et al.  Hierarchical Reachability Graph Generation for Petri Nets , 2002, Formal Methods Syst. Des..

[16]  Giancarlo Mauri,et al.  Quantum Sequential P Systems with Unit Rules and Energy Assigned to Membranes , 2005, Workshop on Membrane Computing.

[17]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[18]  Michael Clausen,et al.  Efficient Solution of Linear Diophantine Equations , 1989, J. Symb. Comput..

[19]  Peter F. Stadler,et al.  Relevant cycles in Chemical reaction Networks , 2001, Adv. Complex Syst..

[20]  Pietro Speroni di Fenizio,et al.  Chemical Organisation Theory , 2005, Bulletin of mathematical biology.

[21]  D. Gillespie.  Exact Stochastic Simulation of Coupled Chemical Reactions , 1977 .

[22]  Michael Muskulus,et al.  Complexity of bio-computation: symbolic dynamics in membrane systems , 2006, Int. J. Found. Comput. Sci..

[23]  Giancarlo Mauri,et al.  Dynamical probabilistic P systems , 2006, Int. J. Found. Comput. Sci..

[24]  N. Kampen,et al.  Stochastic processes in physics and chemistry , 1981 .

[25]  D. Vere-Jones.  Markov Chains , 1972, Nature.

[26]  H. J. Ryser,et al.  Introduction to modern algebra and matrix theory , 1955 .

[27]  David Parker,et al.  Symbolic Representations and Analysis of Large Probabilistic Systems , 2004, Validation of Stochastic Systems.

[28]  Vincenzo Manca,et al.  P systems with reaction maps , 2006, Int. J. Found. Comput. Sci..

[29]  D. Gillespie.  Approximate accelerated stochastic simulation of chemically reacting systems , 2001 .

[30]  Emden R. Gansner,et al.  An open graph visualization system and its applications to software engineering , 2000 .

[31]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[32]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[33]  Christophe Reutenauer,et al.  Aspects mathématiques des réseaux de pétri , 1988 .

[34]  Michael A. Gibson,et al.  Efficient Exact Stochastic Simulation of Chemical Systems with Many Species and Many Channels , 2000 .

[35]  B. Palsson,et al.  The underlying pathway structure of biochemical reaction networks. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[36]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[37]  Martín Matamala,et al.  Some remarks on cycles in graphs and digraphs , 2001, Discret. Math..

[38]  Giancarlo Mauri,et al.  Analysis and Simulation of Dynamics in Probabilistic P Systems , 2005, DNA.

[39]  Francisco José Romero Campero,et al.  Third Brainstorming Week on Membrane Computing , 2005 .

[40]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[41]  K. Burrage,et al.  Binomial leap methods for simulating stochastic chemical kinetics. , 2004, The Journal of chemical physics.

[42]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[43]  Christophe Reutenauer.  Mathematical aspects of Petri nets (French) , 1988 .

[44]  Peter Dittrich,et al.  Chemical Organisation Theory , 2007, Bulletin of mathematical biology.