Brief Announcement: Decidable Graph Languages by Mediated Population Protocols
We work on an extension of the Population Protocol model of Angluin et al.  that allows edges of the communication graph, G, to have states that belong to a constant size set. In this extension, the so called Mediated Population Protocol model (MPP) [2,3], both uniformity and anonymity are preserved. We here study a simplified version of MPP, the Graph Decision Mediated Population Protocol model (GDM), in order to capture MPP’s ability to decide graph languages. We also prove some first impossibility results both for weakly connected and possibly disconnected communication graphs.
- 1.Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 290–299. ACM Press, New York (2004)Google Scholar
- 2.Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Mediated Population Protocols. In: 36th International Colloquium on Automata, Languages and Programming (ICALP), Rhodes, Greece, pp. 363–374, Also FRONTS Technical Report FRONTS-TR-2009-8 (2009), http://fronts.cti.gr/aigaion/?TR=65
- 3.Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Recent Advances in Population Protocols. In: 34th International Symposium on Mathematical Foundations of Computer Science (MFCS), Novy Smokovec, High Tatras, Slovak Republic, pp. 56–76, Also FRONTS Technical Report FRONTS-TR-2009-21 (2009), http://fronts.cti.gr/aigaion/?TR=85