UNIVERSITY of GLASGOW

Computing at Glasgow University
 
Paper ID: 9287

Assume-Guarantee Verification for Probabilistic Systems
Kwiatkowska,M. Norman,G. Parker,D. Qu,H.

Publication Type: Conference Proceedings
Appeared in: Proc. 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'10)
Page Numbers :
Publisher: N/A
Year: 2010
ISBN/ISSN:
Abstract:

We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume- guarantee approach to verification, where both the assumptions made about system components and the guarantees that they provide are regular safety properties, represented by finite automata. Unlike previous proposals for assume-guarantee reasoning about probabilistic systems, our approach does not require that components interact in a fully synchronous fashion. In addition, the compositional verification method is efficient and fully automated, based on a reduction to the problem of multi-objective probabilistic model checking. We present asymmetric and circular assume-guarantee rules, and show how they can be adapted to form quantitative queries, yielding lower and upper bounds on the actual probabilities that a property is satisfied. Our techniques have been implemented and applied to several large case studies, including instances where conventional probabilistic verification is infeasible.


PDF Bibtex entry Endnote XML