Compositional Methods for Probabilistic Systems
We present a compositional trace-based model for probabilistic systems. The behavior of a system with probabilistic choice is a stochastic process, namely, a probability distribution on traces, or “bundle.” Consequently, the semantics of a system with both nondeterministic and probabilistic choice is a set of bundles. The bundles of a composite system can be obtained by combining the bundles of the components in a simple mathematical way. Refinement between systems is bundle containment. We achieve assume-guarantee compositionality for bundle semantics by introducing two scoping mechanisms. The first mechanism, which is standard in compositional modeling, distinguishes inputs from outputs and hidden state. The second mechanism, which arises in probabilistic systems, partitions the state into probabilistically independent regions.
Unable to display preview. Download preview PDF.
- [BdA95]A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Foundations of Software Technology and Theoretical Computer Science, volume 1026 of Lect. Notes in Comp. Sci., pages 499–513. Springer-Verlag, 1995.Google Scholar
- [dA98]L. de Alfaro. Stochastic transition systems. In Concurrency Theory, volume 1466 of Lect. Notes in Comp. Sci., pages 423–438. Springer-Verlag, 1998.Google Scholar
- [dAKN+00]L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of concurrent probabilistic processes using MTBDDs and the Kronecker representation. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lect. Notes in Comp. Sci., pages 395–410. Springer-Verlag, 2000.Google Scholar
- [Der70]C. Derman. Finite State Markovian Decision Processes. Academic Press, 1970.Google Scholar
- [Dil89]D.L. Dill. Trace Theory for Automatic Hierarchical Verification of Speedindependent Circuits. The MIT Press, 1989.Google Scholar
- [JL91]B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes. In Proc. Symp. Logic in Computer Science, pages 266–277. IEEE Computer Society Press, 1991.Google Scholar
- [Lyn96]N.A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.Google Scholar
- [McM97]K.L. McMillan. A compositional rule for hardware design refinement. In Computer-Aided Verification, volume 1254 of Lect. Notes in Comp. Sci., pages 24–35. Springer-Verlag, 1997.Google Scholar
- [Seg95]R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995. Technical Report MIT/LCS/TR-676.Google Scholar
- [SL94]R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. In Concurrency Theory, volume 836 of Lect. Notes in Comp. Sci., pages 481–496. Springer-Verlag, 1994.Google Scholar
- [Var85]M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Proc. Symp. Foundations of Computer Science, pages 327–338. IEEE Computer Society Press, 1985.Google Scholar