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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Ivanov, S. (2012). Basic concurrency resolution in clock-free P systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7184 LNCS, pp. 226–242). https://doi.org/10.1007/978-3-642-28024-5_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
