Compositional methods for probabilistic systems

L. De Alfaro, T.A. Henzinger, R. Jhala, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 351–365.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Author
; ;
Series Title
LNCS
Abstract
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.
Publishing Year
Date Published
2001-08-13
Acknowledgement
This research was supported in part by the SRC contract 99-TJ-683.003, the AFOSR MURI grant F49620-00-1-0327, the MARCO GSRC grant 98-DT-660, the NSF Theory grant CCR-9988172, and the DARPA SEC grant F33615-C-98-3614.
Volume
2154
Page
351 - 365
Conference
CONCUR: Concurrency Theory
IST-REx-ID

Cite this

De Alfaro L, Henzinger TA, Jhala R. Compositional methods for probabilistic systems. In: Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:351-365. doi:10.1007/3-540-44685-0_24
De Alfaro, L., Henzinger, T. A., & Jhala, R. (2001). Compositional methods for probabilistic systems (Vol. 2154, pp. 351–365). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-44685-0_24
De Alfaro, Luca, Thomas A Henzinger, and Ranjit Jhala. “Compositional Methods for Probabilistic Systems,” 2154:351–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001. https://doi.org/10.1007/3-540-44685-0_24.
L. De Alfaro, T. A. Henzinger, and R. Jhala, “Compositional methods for probabilistic systems,” presented at the CONCUR: Concurrency Theory, 2001, vol. 2154, pp. 351–365.
De Alfaro L, Henzinger TA, Jhala R. 2001. Compositional methods for probabilistic systems. CONCUR: Concurrency Theory, LNCS, vol. 2154. 351–365.
De Alfaro, Luca, et al. Compositional Methods for Probabilistic Systems. Vol. 2154, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 351–65, doi:10.1007/3-540-44685-0_24.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar