Skip to main content

Basic Concurrency Resolution in Clock-Free P Systems

  • Conference paper
  • 496 Accesses

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

Abstract

Clock-free P systems are an almost completely asynchronous model of P systems in which each rule application lasts for a different time. This makes the processes in this model more similar to the chemical processes in the biological cell, but also poses similar design problems as in concurrent programming. In this paper an attempt is made to solve synchronisation problems in clock-free P systems using the approaches commonly used in concurrent programming.

Keywords

  • Concurrent Programming
  • Rule Application
  • Synchronisation Problem
  • Synchronisation Strategy
  • Synchronisation Mechanism

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dijkstra, E.W.: Cooperating sequential processes. Technological University, Eindhoven, The Netherlands (1965)

    Google Scholar 

  2. Sburlan, D.: Clock-free P systems. In: Pre-proceedings of the Fifth Workshop on Membrane Computing, Milan, Italy, pp. 372–383 (June 2004)

    Google Scholar 

  3. Downey, A. B.: The Little Book of Semaphores, 2nd edn., Version 2.1.5. Copyright 2005, 2006, 2007, 2008 (Allen B. Downey)

    Google Scholar 

  4. Alhazov, A., Cavaliere, M.: Evolution-communication P systems: Time-freeness. In: Proceedings of the Third Brainstorming Week on Membrane Computing, Sevilla, Spain, January 31st – February 4th, pp. 11–18 (2005)

    Google Scholar 

  5. Ivanov, S.: Formal Strategies in P Systems (submitted)

    Google Scholar 

  6. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    CrossRef  MATH  Google Scholar 

  7. Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press (2010)

    Google Scholar 

  8. Crnogorac, L., Rao, A.S., Ramamohanarao, K.: Classifying Inheritance Mechanisms in Concurrent Object-Oriented Programming. In: Jul, E. (ed.) ECOOP 1998. LNCS, vol. 1445, pp. 571–601. Springer, Heidelberg (1998)

    CrossRef  Google Scholar 

  9. The P systems web page, http://ppage.psystems.eu/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ivanov, S. (2012). Basic Concurrency Resolution in Clock-Free 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_16

Download citation

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

  • 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)