Verifying Emergence of Bounded Time Properties in Probabilistic Swarm Systems

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.

[1]  Christel Baier,et al.  Principles of model checking , 2008 .

[2]  Marta Kwiatkowska,et al.  Advances and challenges of probabilistic model checking , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[3]  Alessio Lomuscio,et al.  Automatic verification of parameterised multi-agent systems , 2013, AAMAS.

[4]  Paulin Fournier,et al.  Parameterized verification of networks of many identical processes. (Vérification paramétrée de réseaux composés d'une multitude de processus identiques) , 2015 .

[5]  Alessio Lomuscio,et al.  A Counter Abstraction Technique for the Verification of Robot Swarms , 2015, AAAI.

[6]  Douglas Graham.  Parameterised verification of randomised distributed systems using state-based models , 2008 .

[7]  Alan F. T. Winfield,et al.  Special issue on swarm robotics , 2008, Swarm Intelligence.

[8]  Alessio Lomuscio,et al.  A Cutoff Technique for the Verification of Parameterised Interpreted Systems with Parameterised Environments , 2013, IJCAI.

[9]  Dario Floreano,et al.  Minimalist Coherent Swarming of Wireless Networked Autonomous Mobile Robots , 2002 .

[10]  Helmut Veith,et al.  Parameterized model checking of fault-tolerant distributed algorithms by abstraction , 2013, FMCAD 2013.

[11]  Cheng Luo,et al.  A logic of probabilistic knowledge and strategy , 2013, AAMAS.

[12]  Boleslaw K. Szymanski,et al.  Efficient and inefficient ant coverage methods , 2001, Annals of Mathematics and Artificial Intelligence.

[13]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[14]  Wenguo Liu,et al.  Modelling a wireless connected swarm of mobile robots , 2008, Swarm Intelligence.

[15]  Alessio Lomuscio,et al.  Verifying Emergent Properties of Swarms , 2015, IJCAI.

[16]  Clare Dixon,et al.  Probabilistic Model Checking of Ant-Based Positionless Swarming , 2016, TAROS.

[17]  Marco Dorigo,et al.  From Natural to Artificial Swarm Intelligence , 1999 .

[18]  Benjamin Aminof,et al.  Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction , 2018, VMCAI.

[19]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[20]  Bruno Sericola,et al.  New results on a generalized coupon collector problem using Markov chains , 2015 .

[21]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[22]  Edmund M. Clarke,et al.  Reasoning about Networks with Many Identical Finite State Processes , 1989, Inf. Comput..

[23]  Clare Dixon,et al.  Analysing robot swarm behaviour via probabilistic model checking , 2012, Robotics Auton. Syst..

[24]  Jamal Bentahar,et al.  Model checking epistemic-probabilistic logic using probabilistic interpreted systems , 2013, Knowl. Based Syst..

[25]  Panagiotis Kouvaros,et al.  Parameterised verification for multi-agent systems , 2016, Artif. Intell..

[26]  S Erol.  Swarm Robotics: From Sources of Inspiration to Domains of Application , 2005 .