Title
Learning Weighted Assumptions for Compositional Verification of Markov Decision Processes.
Abstract
Probabilistic models are widely deployed in various systems. To ensure their correctness, verification techniques have been developed to analyze probabilistic systems. We propose the first sound and complete learning-based compositional verification technique for probabilistic safety properties on concurrent systems where each component is an Markov decision process. Different from previous works, weighted assumptions are introduced to attain completeness of our framework. Since weighted assumptions can be implicitly represented by multiterminal binary decision diagrams (MTBDDs), we give an >i<L>/i<&ast;-based learning algorithm for MTBDDs to infer weighted assumptions. Experimental results suggest promising outlooks for our compositional technique.
Year
DOI
Venue
2016
10.1145/2907943
ACM Trans. Softw. Eng. Methodol.
Keywords
Field
DocType
Compositional verification,probabilistic model checking,algorithmic learning
Computer science,Correctness,Markov decision process,Binary decision diagram,Theoretical computer science,Probabilistic logic,Probabilistic relevance model,Completeness (statistics),Probabilistic model checking
Journal
Volume
Issue
ISSN
25
3
1049-331X
Citations 
PageRank 
References 
3
0.39
57
Authors
5
Name
Order
Citations
PageRank
Fei He117528.32
Xiaowei Gao260.76
Miaofei Wang330.39
Bow-yaw Wang423425.60
Lijun Zhang524537.10