Population protocols are a model of distributed computation intended for the
study of networks of independent computing agents with dynamic communication
structure. Each agent has a finite number of states, and communication
opportunities occur nondeterministically, allowing the agents involved to
change their states based on each other's states. Population protocols are
often studied in terms of reaching a consensus on whether the input
configuration satisfied some predicate.
In the present paper we propose an alternative point of view. Instead of
studying the properties of inputs that a protocol can recognise, we study the
properties of outputs that a protocol eventually ensures. We define
constructive expressive power. We show that for general population protocols
and immediate observation population protocols the constructive expressive
power coincides with the normal expressive power.
Immediate observation protocols also preserve their relatively low
verification complexity in the constructive expressive power setting.
%0 Generic
%1 raskin2020constructive
%A Raskin, Mikhail
%D 2020
%K expressivepower informal populationprotocols preprint
%T Constructive expressive power of population protocols
%X Population protocols are a model of distributed computation intended for the
study of networks of independent computing agents with dynamic communication
structure. Each agent has a finite number of states, and communication
opportunities occur nondeterministically, allowing the agents involved to
change their states based on each other's states. Population protocols are
often studied in terms of reaching a consensus on whether the input
configuration satisfied some predicate.
In the present paper we propose an alternative point of view. Instead of
studying the properties of inputs that a protocol can recognise, we study the
properties of outputs that a protocol eventually ensures. We define
constructive expressive power. We show that for general population protocols
and immediate observation population protocols the constructive expressive
power coincides with the normal expressive power.
Immediate observation protocols also preserve their relatively low
verification complexity in the constructive expressive power setting.
@misc{raskin2020constructive,
abstract = {Population protocols are a model of distributed computation intended for the
study of networks of independent computing agents with dynamic communication
structure. Each agent has a finite number of states, and communication
opportunities occur nondeterministically, allowing the agents involved to
change their states based on each other's states. Population protocols are
often studied in terms of reaching a consensus on whether the input
configuration satisfied some predicate.
In the present paper we propose an alternative point of view. Instead of
studying the properties of inputs that a protocol can recognise, we study the
properties of outputs that a protocol eventually ensures. We define
constructive expressive power. We show that for general population protocols
and immediate observation population protocols the constructive expressive
power coincides with the normal expressive power.
Immediate observation protocols also preserve their relatively low
verification complexity in the constructive expressive power setting.},
added-at = {2020-10-01T17:12:41.000+0200},
author = {Raskin, Mikhail},
biburl = {https://www.bibsonomy.org/bibtex/2ff677be4371cf1ddb9277783439e9957/paves},
interhash = {e14f97b04dfe36c22e0392653e4a3914},
intrahash = {ff677be4371cf1ddb9277783439e9957},
keywords = {expressivepower informal populationprotocols preprint},
note = {http://arxiv.org/abs/2002.07303},
timestamp = {2023-09-24T19:09:46.000+0200},
title = {Constructive expressive power of population protocols},
year = 2020
}