Brief Announcement: Decidable Graph Languages by Mediated Population Protocols

被引：0

作者：

Chatzigiannakis, Ioannis ^{[1
]}

Michail, Othon ^{[1
]}

Spirakis, Paul G. ^{[1
]}

机构：

[1] Univ Patras, RACTI, CEID, Patras 26500, Greece

来源：

DISTRIBUTED COMPUTING, PROCEEDINGS | 2009年 / 5805卷

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We, work on an extension of the Population Protocol model of Angluin et al. [1] that allows edges of Hie communication graph, G, to have states that belong to a constant size set. In this extension, the so called Mediated Population Protocol model (NIPP) [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.

引用

页码：239 / +

页数：2