Skip to main content
SpringerLink
Log in

Parallel and Distributed Algorithms in P Systems

  • Conference paper
Membrane Computing (CMC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7184))

Included in the following conference series:

Abstract

Our group’s recent quest has been to use P systems to model parallel and distributed algorithms. Several framework extensions are recalled or detailed, in particular, modular composition with information hiding, complex symbols, generic rules, reified cell IDs, asynchronous operational modes, asynchronous complexity. We motivate our proposals via P system models of several well-known distributed algorithms, such as leader election and distributed echo. As another type of application, we mention a dynamic programming algorithm for stereo matching in image processing. We suggest criteria to assess the merits of this modelling approach and offer preliminary evaluations of our proposed additional ingredients, which have been useful in refactoring existing systems and could be useful to the larger P systems community.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bălănescu, T., Nicolescu, R., Wu, H.: Asynchronous P systems. International Journal of Natural Computing Research, 1–18 (in press, 2011)

    Google Scholar 

  2. Carnero, J., Díaz-Pernil, D., Molina-Abril, H., Real, P.: Image segmentation inspired by cellular models using hardware programming. In: González-Díaz, R., Real-Jurado, P. (eds.) 3rd International Workshop on Computational Topology in Image Context, pp. 143–150 (2010)

    Google Scholar 

  3. Casiraghi, G., Ferretti, C., Gallini, A., Mauri, G.: A Membrane Computing System Mapped on an Asynchronous, Distributed Computational Environment. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 159–164. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Cavaliere, M., Egecioglu, O., Ibarra, O.H., Ionescu, M., Păun, G., Woodworth, S.: Asynchronous Spiking Neural P Systems: Decidability and Undecidability. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol. 4848, pp. 246–255. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Cavaliere, M., Ibarra, O.H., Păun, G., Egecioglu, O., Ionescu, M., Woodworth, S.: Asynchronous spiking neural P systems. Theor. Comput. Sci. 410, 2352–2364 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cavaliere, M., Mura, I.: Experiments on the reliability of stochastic spiking neural P systems. Natural Computing 7, 453–470 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cavaliere, M., Sburlan, D.: Time and synchronization in membrane systems. Fundam. Inf. 64, 65–77 (2004)

    MathSciNet  MATH  Google Scholar 

  8. Ciobanu, G.: Distributed algorithms over communicating membrane systems. Biosystems 70(2), 123–133 (2003)

    Article  Google Scholar 

  9. Ciobanu, G., Desai, R., Kumar, A.: Membrane Systems and Distributed Computing. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 187–202. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: Toward practical P systems for distributed computing. In: Enachescu, D., Gramatovici, R. (eds.) Seria Matematica-Informatica (Honor of Solomon Marcus on the Occasion of his 85th Anniversary), pp. 23–34. Analele Universitatii Bucuresti (2009)

    Google Scholar 

  11. Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: Edge- and node-disjoint paths in P systems. Electronic Proceedings in Theoretical Computer Science 40, 121–141 (2010)

    Article  Google Scholar 

  12. Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: A Faster P Solution for the Byzantine Agreement Problem. In: Gheorghe, M., Hinze, T., Păun, G., Rozenberg, G., Salomaa, A. (eds.) CMC 2010. LNCS, vol. 6501, pp. 175–197. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: P systems and the Byzantine agreement. Journal of Logic and Algebraic Programming 79(6), 334–349 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: Synchronization in P Modules. In: Calude, C.S., Hagiya, M., Morita, K., Rozenberg, G., Timmis, J. (eds.) UC 2010. LNCS, vol. 6079, pp. 32–44. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: An adaptive algorithm for P system synchronization. In: Gheorghe, M., et al. (eds.) CMC 2011. LNCS, vol. 7184, pp. 139–164. Springer, Heidelberg (2012)

    Google Scholar 

  16. Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: Faster synchronization in P systems. Natural Computing, 1–9 (2011)

    Google Scholar 

  17. Freund, R.: Asynchronous P Systems and P Systems Working in the Sequential Mode. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 36–62. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Frisco, P.: The conformon-P system: a molecular and cell biology-inspired computability model. Theor. Comput. Sci. 312, 295–319 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5, 66–77 (1983)

    Article  MATH  Google Scholar 

  20. Gimel’farb, G.L.: Probabilistic regularisation and symmetry in binocular dynamic programming stereo. Pattern Recognition Letters 23(4), 431–442 (2002)

    Article  MATH  Google Scholar 

  21. Gimel’farb, G., Nicolescu, R., Ragavan, S.: P Systems in Stereo Matching. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds.) CAIP 2011, Part II. LNCS, vol. 6855, pp. 285–292. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  22. Kleijn, J., Koutny, M.: Synchrony and Asynchrony in Membrane Systems. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2006. LNCS, vol. 4361, pp. 66–85. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  23. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)

    MATH  Google Scholar 

  24. Nakamura, Y., Matsuura, T., Satoh, K., Ohta, Y.: Occlusion detectable stereo—occlusion patterns in camera matrix. In: CVPR, pp. 371–378. IEEE Computer Society (1996)

    Google Scholar 

  25. Nicolescu, R., Dinneen, M.J., Kim, Y.-B.: Discovering the Membrane Topology of Hyperdag P Systems. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds.) WMC 2009. LNCS, vol. 5957, pp. 410–435. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  26. Nicolescu, R., Dinneen, M.J., Kim, Y.-B.: Towards structured modelling with hyperdag P systems. International Journal of Computers, Communications and Control 2, 209–222 (2010)

    Google Scholar 

  27. Nicolescu, R., Wu, H.: BFS Solution for Disjoint Paths in P Systems. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds.) UC 2011. LNCS, vol. 6714, pp. 164–176. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  28. Pan, L., Zeng, X., Zhang, X.: Time-free spiking neural P systems. Neural Computation 23, 1320–1342 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  29. Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  30. Peña-Cantillana, F., Díaz-Pernil, D., Berciano, A., Gutiérrez-Naranjo, M.A.: A Parallel Implementation of the Thresholding Problem by Using Tissue-Like P Systems. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds.) CAIP 2011, Part II. LNCS, vol. 6855, pp. 277–284. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  31. Păun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press, Inc., New York (2010)

    Book  MATH  Google Scholar 

  32. Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press (2000)

    Google Scholar 

  33. Yuan, Z., Zhang, Z.: Asynchronous Spiking Neural P System with Promoters. In: Xu, M., Zhan, Y.-W., Cao, J., Liu, Y. (eds.) APPT 2007. LNCS, vol. 4847, pp. 693–702. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Auckland, 92019, Auckland, New Zealand

    Radu Nicolescu

Authors
  1. Radu Nicolescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Sheffield, Regent Court, Portobello Street, S1 4DP, Sheffield, UK

    Marian Gheorghe

  2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 014700, Bucharest, Romania

    Gheorghe Păun

  3. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  4. Turku Centre for Computer Science (TUCS), Leminkaisenkatu 14, 20520, Turku, Finland

    Arto Salomaa

  5. Faculté des Sciences et Technologie, Laboratoire d’Algorithmique, Complexité et Logique (LACL), Université Paris Est – Créteil Val de Marne, 61, av. Général de Gaulle, 94010, Créteil, France

    Sergey Verlan

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nicolescu, R. (2012). Parallel and Distributed Algorithms in P Systems. In: Gheorghe, M., Păun, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds) Membrane Computing. CMC 2011. Lecture Notes in Computer Science, vol 7184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28024-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28024-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28023-8

  • Online ISBN: 978-3-642-28024-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation