IDEAS home Printed from https://ideas.repec.org/a/igg/jncr00/v2y2011i2p1-18.html
   My bibliography  Save this article

Asynchronous P Systems

Author

Listed:
  • Tudor Balanescu

    (University of Pitesti, Romania)

  • Radu Nicolescu

    (University of Auckland, New Zealand)

  • Huiling Wu

    (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.

Suggested Citation

  • Tudor Balanescu & Radu Nicolescu & Huiling Wu, 2011. "Asynchronous P Systems," International Journal of Natural Computing Research (IJNCR), IGI Global, vol. 2(2), pages 1-18, April.
    • Handle: RePEc:igg:jncr00:v:2:y:2011:i:2:p:1-18
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jncr.2011040101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jncr00:v:2:y:2011:i:2:p:1-18. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.