BALANESCU , Tudor

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