Efficient First-Order Temporal Logic for Infinite-State Systems

In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for this form of specification and tractable enough for practical deductive verification. Importantly, the power of the temporal language allows us to describe (and verify) asynchronous systems, communication delays and more complex properties such as liveness and fairness properties. These aspects appear difficult for many other approaches to infinite-state verification.Comment: 16 pages, 2 figure

Self-employment among the Armed Forces Community

The Institute for Employment Research at the University of Warwick, QinetiQ and X-Forces Enterprise were commissioned by Forces in Mind Trust to understand what more could be done to support the Armed Forces Community in pursuing self-employment and thereby help to maximise their chances of a successful and sustainable transition. This research seeks to fill the current gap in knowledge and contribute to policy-making and service delivery

Practical First-Order Temporal Reasoning

In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for this form of specification and tractable enough for practical deductive verification. Importantly, the power of the temporal language allows us to describe (and verify) asynchronous systems, communication delays and more complex liveness and fairness properties. These aspects appear difficult for many other approaches to infinite-state verification. 1

Towards temporal verification of swarm robotic systems

A robot swarm is a collection of simple robots designed to work together to carry out some task. Such swarms rely on the simplicity of the individual robots; the fault tolerance inherent in having a large population of identical robots; and the self-organised behaviour of the swarm as a whole. Although robot swarms present an attractive solution to demanding real-world applications, designing individual control algorithms that can guarantee the required global behaviour is a difficult problem. In this paper we assess and apply the use of formal verification techniques for analysing the emergent behaviours of robotic swarms. These techniques, based on the automated analysis of systems using temporal logics, allow us to analyse whether all possible behaviours within the robot swarm conform to some required specification. In particular, we apply model-checking, an automated and exhaustive algorithmic technique, to check whether temporal properties are satisfied on all the possible behaviours of the system. We target a particular swarm control algorithm that has been tested in real robotic swarms, and show how automated temporal analysis can help to refine and analyse such an algorithm. © 2012 Elsevier B.V. All rights reserved

Host species vary in infection probability, sub-lethal effects, and costs of immune response when exposed to an amphibian parasite

The amphibian parasite Batrachochytrium dendrobatidis (Bd) is regarded as an extreme generalist, infecting over 500 species, but amongst these hosts there exists a great deal of variation in the susceptibility to and the costs of parasite exposure. We use two infection experiments to determine whether inter-specific variation in the sublethal and lethal effects of parasite exposure exist in two host species. We then tested the relative roles of host density and diversity on infection probability of a focal susceptible host. Our results show significant heterogeneity in host species response to parasite exposure, and that both lethal and sub-lethal costs exist in individuals that are able to resist infection, indicating that successful immune response to infection comes at a cost. Further, we show that increasing host density significantly increased the likelihood of susceptible individuals becoming infected with Bd irrespective of host diversity and variation in host susceptibility. These results suggest that populations of resistant species are likely to suffer ill-effects of exposure to Bd regardless of their infection status, and that at the stage of initial infection there was no support for the dilution of transmission events, in contrast to other studies that focus on subsequent transmission of infection

Formal Verification of an Autonomous Personal Robotic Assistant

Human–robot teams are likely to be used in a variety of situations wherever humans require the assistance of robotic systems. Obvious examples include healthcare and manufacturing, in which people need the assistance of machines to perform key tasks. It is essential for robots working in close proximity to people to be both safe and trustworthy. In this paper we examine formal verification of a high-level planner/scheduler for autonomous personal robotic assistants such as CareO-bot. We describe how a model of Care-O-bot and its environment was developed using Brahms, a multiagent workflow language. Formal verification was then carried out by translating this to the input language of an existing model checker. Finally we present some formal verification results and describe how these could be complemented by simulation-based testing and realworld end-user validation in order to increase the practical and perceived safety and trustworthiness of robotic assistants

Formal Verification of Synchronisation, Gossip and Environmental Effects for Wireless Sensor Networks

The Internet of Things (IoT) promises a revolution in the monitoring and control of a wide range of applications, from urban water supply networks and precision agriculture food production, to vehicle connectivity and healthcare monitoring. For applications in such critical areas, control software and protocols for IoT systems must be verified to be both robust and reliable. Two of the largest obstacles to robustness and reliability in IoT systems are effects on the hardware caused by environmental conditions, and the choice of parameters used by the protocol. In this paper we use probabilistic model checking to verify that a synchronisation and dissemination protocol for Wireless Sensor Networks (WSNs) is correct with respect to its requirements, and is not adversely affected by the environment. We show how the protocol can be converted into a logical model and then analysed using the probabilistic model-checker, PRISM. Using this approach we prove under which circumstances the protocol is guaranteed to synchronise all nodes and disseminate new information to all nodes. We also examine the bounds on synchronisation as the environment changes the performance of the hardware clock, and investigate the scalability constraints of this approach