Skip to Main content Skip to Navigation
Conference papers

Automated Learning of Probabilistic Assumptions for Compositional Reasoning

Abstract : Probabilistic verification techniques have been applied to the formal modelling and analysis of a wide range of systems, from commu- nication protocols such as Bluetooth, to nanoscale computing devices, to biological cellular processes. In order to tackle the inherent challenge of scalability, compositional approaches to verification are sorely needed. An example is assume-guarantee reasoning, where each component of a system is analysed independently, using assumptions about the other components that it interacts with. We discuss recent developments in the area of automated compositional verification techniques for probabilistic systems. In particular, we describe techniques to automatically generate probabilistic assumptions that can be used as the basis for compositional reasoning. We do so using algorithmic learning techniques, which have already proved to be successful for the generation of assumptions for compositional verification of non-probabilistic systems. We also present recent improvements and extensions to this work and survey some of the promising potential directions for further research in this area.
Document type :
Conference papers
Complete list of metadata
Contributor : Hongyang Qu Connect in order to contact the contributor
Submitted on : Thursday, December 1, 2011 - 2:15:06 PM
Last modification on : Tuesday, September 8, 2020 - 4:58:02 PM
Long-term archiving on: : Sunday, December 4, 2016 - 4:07:20 PM


Publisher files allowed on an open archive


  • HAL Id : hal-00647067, version 1



Lu Feng, Marta Kwiatkowska, David Parker. Automated Learning of Probabilistic Assumptions for Compositional Reasoning. 14th International Conference on Fundamental Approaches to Software Engineering (FASE'11), 2011, Saarbrücken, Germany. pp.2--17. ⟨hal-00647067⟩



Record views


Files downloads