Title
Assume-Guarantee verification for probabilistic systems
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.
Year
DOI
Venue
2010
10.1007/978-3-642-12002-2_3
TACAS
Keywords
Field
DocType
assume-guarantee verification,assume-guarantee reasoning,assume-guarantee approach,present asymmetric,components interact,circular assume-guarantee rule,multi-objective probabilistic model checking,compositional verification technique,probabilistic system,conventional probabilistic verification,compositional verification method
Divergence-from-randomness model,Discrete mathematics,Nondeterministic algorithm,Computer science,Algorithm,Probabilistic CTL,Finite-state machine,Theoretical computer science,Probabilistic analysis of algorithms,Probabilistic logic,Probabilistic model checking
Conference
Volume
ISSN
ISBN
6015
0302-9743
3-642-12001-6
Citations 
PageRank 
References 
57
1.58
21
Authors
4
Name
Order
Citations
PageRank
Marta Z. Kwiatkowska16118322.21
Gethin Norman24163193.68
David Parker34018184.00
Hongyang Qu459235.13