Algorithms: Algorithm 329: Distribution of indistinguishable objects into distinguishable slots
Communications of the ACM
Logic in Computer Science: Modelling and Reasoning about Systems
Logic in Computer Science: Modelling and Reasoning about Systems
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
The Dynamics of Probabilistic Population Protocols
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Recent Advances in Population Protocols
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Not All Fair Probabilistic Schedulers Are Equivalent
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Brief announcement: decidable graph languages by mediated population protocols
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Formal modeling and analysis of wireless sensor network algorithms in real-time maude
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Theoretical Computer Science
Survey: Computational models for networks of tiny artifacts: A survey
Computer Science Review
Computing with large populations using interactions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
In this work, we study the Population Protocol model of Angluin et al. from the perspective of protocol verification. In particular, we are interested in algorithmically solving the problem of determining whether a given population protocol conforms to its specifications. Since this is the first work on verification of population protocols, we redefine most notions of population protocols in order to make them suitable for algorithmic verification. Moreover, we formally define the general verification problem and some interesting special cases. All these problems are shown to be NP-hard. We next propose some first algorithmic solutions for a natural special case. Finally, we conduct experiments and algorithmic engineering in order to improve our verifiers' running times.