Basic concurrency resolution in clock-free p systems

  • Authors:
  • Sergiu Ivanov

  • Affiliations:
  • Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişinău, Moldova

  • Venue:
  • CMC'11 Proceedings of the 12th international conference on Membrane Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.