Published April 4, 2016 | Version v1
Publication

Asynchronous P Systems (Draft)

Description

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 algorithms achieve a performance comparable to the standard versions.

Additional details

Identifiers

URL
https://idus.us.es/handle/11441/39384
URN
urn:oai:idus.us.es:11441/39384