Affiliation:
1. University of Piteşti, Romania
2. University of Auckland, New Zealand
Abstract
In this paper, the authors propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the field of distributed algorithms. The authors validate the proposed approach by implementing several well-known distributed depth-first search (DFS) and breadth-first search (BFS) algorithms. Empirical results show that the proposed P algorithms have shorter descriptions and achieve a performance comparable to the corresponding distributed algorithms.
Reference29 articles.
1. A new distributed Depth-First-Search algorithm
2. HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?
3. Casiraghi, G., Ferretti, C., Gallini, A., & Mauri, G. (2005). A membrane computing system mapped on an asynchronous, distributed computational environment. In R. Freund, G. Păun, G. Rozenberg, & A. Salomaa (Eds.), Proceedings of the 6th International Workshop on Membrane Computing (LNCS 3850, pp. 159-164).
4. Cavaliere, M., Egecioglu, O., Ibarra, O., Ionescu, M., Păun, G., & Woodworth, S. (2008). Asynchronous spiking neural P systems: Decidability and undecidability. In M. Garzon & H. Yan (Eds.), Proceedings of the 13th International Meeting on DNA Computing (LNCS 4848, pp. 246-255).
5. Asynchronous spiking neural P systems