Model checking learning agent systems using Promela with embedded C code and abstraction. (November 2016)

• Record Type: Journal Article
• Authors: Kirwan, Ryan; Miller, Alice; Porr, Bernd
• Is Part Of: Formal aspects of computing. Volume 28:Number 6(2016)
• Page Start: 1027
• Page End: 1056
• Publication Date: 2016-11
• Subjects: Model checking -- abstraction -- Agent -- Simulation -- Learning; Computer science -- Periodicals; 004.05
• DOI: 10.1007/s00165-016-0382-2
• Languages: English
• ISSNs: 0934-5043

Abstract

Abstract As autonomous systems become more prevalent, methods for their verification will become more widely used. Model checking is a formal verification technique that can help ensure the safety of autonomous systems, but in most cases it cannot be applied by novices, or in its straight "off-the-shelf" form. In order to be more widely applicable it is crucial that more sophisticated techniques are used, and are presented in a way that is reproducible by engineers and verifiers alike. In this paper we demonstrate in detail two techniques that are used to increase the power of model checking using the model checker Spin . The first of these is the use of embedded C code within Promela specifications, in order to accurately reflect robot movement. The second is to use abstraction together with a simulation relation to allow us to verify multiple environments simultaneously. We apply these techniques to a fairly simple system in which a robot moves about a fixed circular environment and learns to avoid obstacles. The learning algorithm is inspired by the way that insects learn to avoid obstacles in response to pain signals received from their antennae. Crucially, we prove that our abstraction is sound for our example system—a step that is often omitted but is vital if formal verification is to be widely accepted as a useful and meaningful approach.