We present an automated technique that combines fault injection with model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems. We define a general method for mutating a multi-agent systems model representing correct behaviour by injecting faults into it, and specification patterns based on temporal-epistemic formulas to reason about the correct and faulty behaviours of the mutated model. The technique is implemented in a toolkit that can be used for injecting automatically faults into a multi-agent systems program. The usefulness of the methodology is demonstrated by injecting a number of faults into a model of the IEEE 802.5 token ring LAN protocol and analysing the protocol's fault tolerance, by verifying a number of temporal-epistemic specifications.

Journal Article To Parallelize or to Optimize? Get access Jonathan Ezekiel, Jonathan Ezekiel Department of Computing, Imperial College, London, UK.E-mail: [email protected] Search for other works by this author on: Oxford Academic Google Scholar Gerald Lüttgen, Gerald Lüttgen Department of Computer Science, University of York, Heslington, York YO10 5DD, UK.E-mail: [email protected] Search for other works by this author on: Oxford Academic Google Scholar Radu Siminiceanu Radu Siminiceanu National Institute of Aerospace, Hampton, Virginia, USA.E-mail: [email protected] Search for other works by this author on: Oxford Academic Google Scholar Journal of Logic and Computation, Volume 21, Issue 1, February 2011, Pages 85–120, https://doi.org/10.1093/logcom/exp006 Published: 12 February 2009 Article history Received: 29 February 2008 Published: 12 February 2009

We propose a general analysis method for recursive, concurrent programs that tracks effectively procedure calls and returns in a concurrent context, even in the presence of unbounded recursion and infinite-state variables like integers. This method generalizes the relational interprocedural analysis of sequential programs to the concurrent case. We implemented it for programs with scalar variables, and we experimented several classical synchronisation protocols in order to illustrate the precision of our technique, but also to analyze the approximations it performs.