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
相关论文
共 41 条
  • [1] Stably Decidable Graph Languages by Mediated Population Protocols
    Chatzigiannakis, Ioannis
    Michail, Othon
    Spirakis, Paul G.
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, 2010, 6366 : 252 - 266
  • [2] Brief Announcement: Population Protocols Are Fast
    Kosowski, Adrian
    Uznanski, Przemyslaw
    PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2018, : 475 - 477
  • [3] Brief Announcement: Space- Optimal Naming in Population Protocols
    Burman, Janna
    Beauquier, Joffroy
    Sohier, Devan
    PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2018, : 479 - 481
  • [4] Brief Announcement: Population Protocols Decide Double-exponential Thresholds
    Czerner, Philipp
    PROCEEDINGS OF THE 2023 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2023, 2023, : 28 - 31
  • [5] Brief announcement: On augmented graph navigability
    Fraigniaud, Pierre
    Lebhar, Emmanuelle
    Lotker, Zvi
    Distributed Computing, Proceedings, 2006, 4167 : 551 - 553
  • [6] A Brief Announcement: Regular and Dyck Languages in MPC
    Gilbert, Jacob
    Hajiaghayi, MohammadTaghi
    PROCEEDINGS OF THE 35TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2023, 2023, : 113 - 116
  • [7] Brief Announcement: Graph Matching in Massive Datasets
    Behnezhad, Soheil
    Derakhshan, Mahsa
    Esfandiari, Hossein
    Tan, Elif
    Yami, Hadi
    PROCEEDINGS OF THE 29TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'17), 2017, : 133 - 136
  • [8] Brief Announcement: How Large is your Graph?
    Kanade, Varun
    Mallmann-Trenn, Frederik
    Verdugo, Victor
    PROCEEDINGS OF THE ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'17), 2017, : 195 - 197
  • [9] Brief announcement: Convergence analysis of scalable gossip protocols
    Patterson, Stacy
    Bamieh, Bassam
    El Abbadi, Amr
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2006, 4167 : 540 - 542
  • [10] Brief Announcement: Efficient Graph Algorithms without Synchronization
    Schneider, Johannes
    Wattenhofer, Roger
    PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2010, : 289 - 290
12345