A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Model checking of emergent behaviour properties of robot swarms
2011
Proceedings of the Estonian Academy of Sciences
This paper presents a case study on scalability of explicit state model checking. Three state space reduction methodsstate vector compression, bit state hashing, and symmetry reduction -were applied on an exercise with the objective of verifying a distributed coordination algorithm for robot swarms. Based on the analysis results, the feasibility of using explicit state model checking to prove properties of large multi-agent systems is questioned and the limitations faced in verifying a dynamic cleaning algorithm are outlined.
doi:10.3176/proc.2011.1.05
fatcat:oiktdzc57fgyvoje2gnoftmw6i