Accretive Rules in Cayley P Systems

During a discussion taking place at WMC'01, G. Paun put the question of what could be computed only by moving symbols between membranes. In this paper we provide some elements of the answer, in a setting similar to tissue P systems, where the set of membranes is organized into a finite graph or into a Cayley graph, and using a very simple propagation process characterizing accretive growth. Our main result is to characterize the final configuration as a least fixed point and to establish two series of approximations that converge to it. All the notions introduced (Cayley graph of membranes, accretive rule and iteration) have been implemented in the MGS programming language and the two approximation series can be effectively computed in Pressburger arithmetics using the omega calculator in the case of Abelian Cayley graphs.

[1]  Zsuzsanna Róka.  Simulations Between Cellular Automata on Cayley Graphs , 1995, LATIN.

[2]  Zsuzsanna Róka,et al.  The firing squad synchronization problem on Cayley graphs , 1995, Theor. Comput. Sci..

[3]  Jean-Louis Giavitto,et al.  A framework for the recursive definition of data structures , 2000, PPDP '00.

[4]  D. Thieffry,et al.  Dynamical behaviour of biological regulatory networks—I. Biological role of feedback loops and practical use of the concept of the loop-characteristic state , 1995 .

[5]  Richard M. Karp,et al.  The Organization of Computations for Uniform Recurrence Equations , 1967, JACM.

[6]  Gheorghe Paun,et al.  On the Power of Membrane Computing , 1999, J. Univers. Comput. Sci..

[7]  Patrice Quinton,et al.  Computability of recurrence equations , 1993, Theor. Comput. Sci..

[8]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[9]  Olivier Michel,et al.  Computational models for integrative and developmental biology , 2002 .

[10]  Gheorghe Paun,et al.  Computing with Membranes: An Introduction , 1999, Bull. EATCS.

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

[12]  Jean-Louis Giavitto,et al.  The Topological Structures of Membrane Computing , 2002, Fundam. Informaticae.

[13]  Marie-Claude Heydemann,et al.  Cayley graphs and interconnection networks , 1997 .

[14]  Gheorghe Paun,et al.  On Synchronization in P Systems , 1999, Fundam. Informaticae.

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

[16]  Zsuzsanna Róka,et al.  One-Way Cellular Automata on Cayley Graphs , 1993, Theor. Comput. Sci..

[17]  William Pugh,et al.  Transitive Closure of Infinite Graphs and its Applications , 1995, Int. J. Parallel Program..

[18]  J. R. Pierce,et al.  Symposium on Information Theory in Biology , 1959 .

[19]  G Păun,et al.  From cells to computers: computing with membranes (P systems). , 2001, Bio Systems.

[20]  Alfonso Rodríguez-Patón,et al.  Tissue P systems , 2003, Theor. Comput. Sci..