A Counter Abstraction Technique for the Verification of Robot Swarms

Authors

  • Panagiotis Kouvaros Imperial College London
  • Alessio Lomuscio Imperial College London

DOI:

https://doi.org/10.1609/aaai.v29i1.9442

Keywords:

Verification, Model Checking, Parameterised Verification, Robotic Swarms

Abstract

We study parameterised verification of robot swarms against temporal-epistemic specifications. We relax some of the significant restrictions assumed in the literature and present a counter abstraction approach that enable us to verify a potentially much smaller abstract model when checking a formula on a swarm of any size. We present an implementation and discuss experimental results obtained for the alpha algorithm for robot swarms.

AAAI 2015 Proceedings Cover

Downloads

Published

2015-02-18

How to Cite

Kouvaros, P., & Lomuscio, A. (2015). A Counter Abstraction Technique for the Verification of Robot Swarms. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1). https://doi.org/10.1609/aaai.v29i1.9442

Issue

Vol. 29 No. 1 (2015): Twenty-Ninth AAAI Conference on Artificial Intelligence

Section

AAAI Technical Track: Multiagent Systems