Leveraging Weighted Automata in Compositional Reasoning about
Concurrent Probabilistic Systems
In 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-15)
, pages 503-514, ACM
Downloads: pdf, bibURL: http://doi.acm.org/10.1145/2676726.2676998
Abstract. 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 multi-terminal binary decision diagrams (MTBDD's), we give an L*-based learning algorithm for MTBDD's to infer weighted assumptions. Experimental results suggest promising outlooks for our compositional technique.