Assume-Guarantee Verification for Probabilistic Systems

  • Marta Kwiatkowska
  • Gethin Norman
  • David Parker
  • Hongyang Qu
Conference paper

DOI: 10.1007/978-3-642-12002-2_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6015)
Cite this paper as:
Kwiatkowska M., Norman G., Parker D., Qu H. (2010) Assume-Guarantee Verification for Probabilistic Systems. In: Esparza J., Majumdar R. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2010. Lecture Notes in Computer Science, vol 6015. Springer, Berlin, Heidelberg

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Marta Kwiatkowska
    • 1
  • Gethin Norman
    • 2
  • David Parker
    • 1
  • Hongyang Qu
    • 1
  1. 1.Oxford University Computing LaboratoryOxfordUK
  2. 2.Department of Computing ScienceUniversity of GlasgowGlasgowUK

Personalised recommendations