Compositional Methods for Probabilistic Systems

  • Luca de Alfaro
  • Thomas A. Henzinger
  • Ranjit Jhala
Conference paper

DOI: 10.1007/3-540-44685-0_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2154)
Cite this paper as:
de Alfaro L., Henzinger T.A., Jhala R. (2001) Compositional Methods for Probabilistic Systems. In: Larsen K.G., Nielsen M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Luca de Alfaro
    • 1
  • Thomas A. Henzinger
    • 1
  • Ranjit Jhala
    • 1
  1. 1.Electrical Engineering and Computer SciencesUniversity of CaliforniaBerkeley

Personalised recommendations