Probabilistic model checking of labelled Markov processes via finite approximate bisimulations

Abate, A., Kwiatkowska, M., Norman, G. and Parker, D. (2014) Probabilistic model checking of labelled Markov processes via finite approximate bisimulations. Lecture Notes in Computer Science, 8464, pp. 40-58. (doi: 10.1007/978-3-319-06880-0_2)

Full text not currently available from Enlighten.

Publisher's URL:


This paper concerns labelled Markov processes (LMPs), probabilistic models over uncountable state spaces originally introduced by Prakash Panangaden and colleagues. Motivated by the practical application of the LMP framework, we study its formal semantics and the relationship to similar models formulated in control theory. We consider notions of (exact and approximate) probabilistic bisimulation over LMPs and, drawing on methods from both formal verification and control theory, propose a simple technique to compute an approximate probabilistic bisimulation of a given LMP, where the resulting abstraction is characterised as a finite-state labelled Markov chain (LMC). This construction enables the application of automated quantitative verification and policy synthesis techniques over the obtained abstract model, which can be used to perform approximate analysis of the concrete LMP. We illustrate this process through a case study of a multi-room heating system that employs the probabilistic model checker PRISM.

Item Type:Articles
Glasgow Author(s) Enlighten ID:Norman, Dr Gethin and Kwiatkowska, Prof Marta
Authors: Abate, A., Kwiatkowska, M., Norman, G., and Parker, D.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science

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