IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Asynchronous P Systems

Asynchronous P Systems
View Sample PDF
Author(s): Tudor Bălănescu (University of Piteşti, Romania), Radu Nicolescu (University of Auckland, New Zealand)and Huiling Wu (University of Auckland, New Zealand)
Copyright: 2014
Pages: 19
Source title: Natural Computing for Simulation and Knowledge Discovery
Source Author(s)/Editor(s): Leandro Nunes de Castro (Mackenzie University, Brazil)
DOI: 10.4018/978-1-4666-4253-9.ch005

Purchase

View Asynchronous P Systems on the publisher's website for pricing and purchasing information.

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.

Related Content

S. Karthigai Selvi, Sharmistha Dey, Siva Shankar Ramasamy, Krishan Veer Singh. © 2025. 16 pages.
S. Sheeba Rani, M. Mohammed Yassen, Srivignesh Sadhasivam, Sharath Kumar Jaganathan. © 2025. 22 pages.
U. Vignesh, K. Gokul Ram, Abdulkareem Sh. Mahdi Al-Obaidi. © 2025. 22 pages.
Monica Bhutani, Monica Gupta, Ayushi Jain, Nishant Rajoriya, Gitika Singh. © 2025. 24 pages.
U. Vignesh, Arpan Singh Parihar. © 2025. 34 pages.
Sharmistha Dey, Krishan Veer Singh. © 2025. 20 pages.
Kalpana Devi. © 2025. 26 pages.
Body Bottom