Asynchronous P Systems
Published in International Journal of Natural Computing Research • Apr 1, 2011
NobleIDNI6P97W39R54S45
Authors:,,
Tudor Bălănescu
Radu Nicolescu
Huiling Wu
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...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!