Generalized Communicating P Systems Working in Fair Sequential Model
Distributed, Parallel, and Cluster Computing
2011-08-18 v1 Emerging Technologies
Formal Languages and Automata Theory
Abstract
In this article we consider a new derivation mode for generalized communicating P systems (GCPS) corresponding to the functioning of population protocols (PP) and based on the sequential derivation mode and a fairness condition. We show that PP can be seen as a particular variant of GCPS. We also consider a particular stochastic evolution satisfying the fairness condition and obtain that it corresponds to the run of a Gillespie's SSA. This permits to further describe the dynamics of GCPS by a system of ODEs when the population size goes to the infinity.
Cite
@article{arxiv.1108.3432,
title = {Generalized Communicating P Systems Working in Fair Sequential Model},
author = {Antoine Spicher and Sergey Verlan},
journal= {arXiv preprint arXiv:1108.3432},
year = {2011}
}
Comments
Presented at MeCBIC 2011