An inductive technique for parameterised model checking of degenerative distributed randomised protocols

Graham, D., Calder, M. and Miller, A. (2009) An inductive technique for parameterised model checking of degenerative distributed randomised protocols. Electronic Notes in Theoretical Computer Science, 250(1), pp. 87-103. (doi:10.1016/j.entcs.2009.08.007)

Full text not currently available from Enlighten.

Abstract

We present a technique to tackle the parameterised probabilistic model checking problem for a particular class of randomised distributed systems, which we model as Markov Decision Processes. These systems, termed \emph{degenerative}, have the property that a model of a system with some communication graph will eventually behave like a model of a system with a \emph{reduced} graph. We describe an induction schema for reasoning about models of a degenerative system over arbitrary graphs. We thereby show that a certain class of quantitative LTL properties will hold for a model of a system with any communication graph if it holds for all models of a system with some base graph. We demonstrate our technique via a case study (a randomised leader election protocol) specified using the PRISM modelling language.

Item Type:Articles
Keywords:parameterised probabilistic model checking
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Calder, Professor Muffy and Miller, Dr Alice
Authors: Graham, D., Calder, M., and Miller, A.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Electronic Notes in Theoretical Computer Science
ISSN:1571-0661
ISSN (Online):1571-0661

University Staff: Request a correction | Enlighten Editors: Update this record