Asynchronous P Systems (Draft)

In this paper, we propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the field of distributed algorithms. We validate our approach by implementing several well-known distributed depth-first search (DFS) and breadth-first search (BFS) algorithms. Empirical results show that our P algorithms achieve a performance comparable to the standard versions.

[1]  Oscar H. Ibarra,et al.  Asynchronous spiking neural P systems , 2009, Theor. Comput. Sci..

[2]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[3]  Matteo Cavaliere,et al.  Time and Synchronization in Membrane Systems , 2005, Fundam. Informaticae.

[4]  Maciej Koutny,et al.  Synchrony and Asynchrony in Membrane Systems , 2006, Workshop on Membrane Computing.

[5]  Radu Nicolescu,et al.  Vertex-Disjoint Paths in P~Modules , 2010 .

[6]  Israel Cidon.  Yet Another Distributed Depth-First-Search Algorithm , 1988, Inf. Process. Lett..

[7]  Gheorghe Paun,et al.  Introduction to Membrane Computing , 2006, Applications of Membrane Computing.

[8]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[9]  Rudolf Freund,et al.  Asynchronous P Systems and P Systems Working in the Sequential Mode , 2004, Workshop on Membrane Computing.

[10]  Mario J. Pérez-Jiménez,et al.  Depth-First Search with P Systems , 2010, Int. Conf. on Membrane Computing.

[11]  Radu Nicolescu,et al.  BFS Solution for Disjoint Paths in P Systems , 2011, UC.

[12]  Marian Gheorghe,et al.  How to Synchronize the Activity of All Components of a P System? , 2008, Int. J. Found. Comput. Sci..

[13]  Giancarlo Mauri,et al.  A Membrane Computing System Mapped on an Asynchronous, Distributed Computational Environment , 2005, Workshop on Membrane Computing.

[14]  Baruch Awerbuch,et al.  A New Distributed Depth-First-Search Algorithm , 1985, Inf. Process. Lett..

[15]  Radu Nicolescu,et al.  Discovering the Membrane Topology of Hyperdag P Systems , 2009, Workshop on Membrane Computing.

[16]  George Havas,et al.  Distributed Algorithms for Depth-First Search , 1996, Inf. Process. Lett..

[17]  Yung H. Tsin.  Some remarks on distributed depth-first search , 2002, Inf. Process. Lett..

[18]  Radu Nicolescu,et al.  Edge- and Node-Disjoint Paths in P Systems , 2010, MeCBIC.

[19]  Radu Nicolescu,et al.  P systems and the Byzantine agreement , 2010, J. Log. Algebraic Methods Program..

[20]  S. Sitharama Iyengar,et al.  An Efficient Distributed Depth-First-Search Algorithm , 1989, Inf. Process. Lett..

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

[22]  Xiangxiang Zeng,et al.  Time-Free Spiking Neural P Systems , 2011, Neural Computation.

[23]  Zhiguo Zhang,et al.  Asynchronous Spiking Neural P System with Promoters , 2007, APPT.

[24]  Oscar H. Ibarra,et al.  Asynchronous Spiking Neural P Systems: Decidability and Undecidability , 2007, DNA.