Verifying Emergence of Bounded Time Properties in Probabilistic Swarm Systems
Lists
Only you see this
Abstract
We introduce a parameterised semantics for reasoning about swarms as unbounded collections of agents in a probabilistic setting. We develop a method for the formal identification of emergent properties, expressed in a fragment of the probabilistic logic PCTL. We introduce algorithms for solving the related decision problems and show their correctness. We present an implementation and evaluate its performance on an ant coverage algorithm.
BibTeX
@inproceedings{lomuscio2018verifying,
author = {Alessio Lomuscio and Edoardo Pirovano},
title = {{Verifying Emergence of Bounded Time Properties in Probabilistic Swarm Systems}},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2018},
doi = {10.24963/ijcai.2018/56},
}Loading related content...