Brief announcement: decidable graph languages by mediated population protocols

Authors:
Ioannis Chatzigiannakis;Othon Michail;Paul G. Spirakis
Affiliations:
Research Academic Computer Technology Institute and Computer Engineering and Informatics Department, University of Patras, Patras, Greece;Research Academic Computer Technology Institute and Computer Engineering and Informatics Department, University of Patras, Patras, Greece;Research Academic Computer Technology Institute and Computer Engineering and Informatics Department, University of Patras, Patras, Greece
Venue:
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Year:
2009

Citing 2
Cited 4

Computation in networks of passively mobile finite-state sensors

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Recent Advances in Population Protocols

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009

All symmetric predicates in NSPACE(n2) are stably computable by the mediated population protocol model

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Algorithmic verification of population protocols

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Stably decidable graph languages by mediated population protocols

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Survey: Computational models for networks of tiny artifacts: A survey

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

We work on an extension of the Population Protocol model of Angluin et al. [1] 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.