Practical applications of probabilistic model checking to communication protocols

Duflot, M., Kwiatkowska, M., Norman, G. , Parker, D., Peyronnet, S., Picaronny, C. and Sproston, J. (2012) Practical applications of probabilistic model checking to communication protocols. In: Gnesi, S. and Margaria, T. (eds.) Formal Methods for Industrial Critical Systems: A Survey of Applications. Wiley, pp. 133-150. ISBN 9780470876183 (doi: 10.1002/9781118459898.ch7)

[img] Text



Probabilistic model checking is a formal verification technique for the analysis of systems that exhibit stochastic behaviour. It has been successfully employed in an extremely wide array of application domains including, for example, communication and multimedia protocols, security and power management. In this chapter we focus on the applicability of these techniques to the analysis of communication protocols. An analysis of the performance of such systems must successfully incorporate several crucial aspects, including concurrency between multiple components, real-time constraints and randomisation. Probabilistic model checking, in particular using probabilistic timed automata, is well suited to such an analysis. We provide an overview of this area, with emphasis on an industrially relevant case study: the IEEE 802.3 (CSMA/CD) protocol. We also discuss two contrasting approaches to the implementation of probabilistic model checking, namely those based on numerical computation and those based on discrete-event simulation. Using results from the two tools PRISM and APMC, we summarise the advantages, disadvantages and trade-offs associated with these techniques.

Item Type:Book Sections
Glasgow Author(s) Enlighten ID:Norman, Dr Gethin
Authors: Duflot, M., Kwiatkowska, M., Norman, G., Parker, D., Peyronnet, S., Picaronny, C., and Sproston, J.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science

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