{"volume":2154,"_id":"4632","quality_controlled":"1","doi":"10.1007/3-540-44685-0_24","author":[{"first_name":"Luca","last_name":"De Alfaro","full_name":"De Alfaro, Luca"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Ranjit","full_name":"Jhala, Ranjit","last_name":"Jhala"}],"oa_version":"None","status":"public","day":"13","date_published":"2001-08-13T00:00:00Z","scopus_import":"1","alternative_title":["LNCS"],"title":"Compositional methods for probabilistic systems","publist_id":"75","extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","page":"351 - 365","conference":{"end_date":"2001-08-25","name":"CONCUR: Concurrency Theory","location":"Aalborg, Denmark","start_date":"2001-08-20"},"publication_identifier":{"isbn":["9783540424970"]},"type":"conference","citation":{"short":"L. De Alfaro, T.A. Henzinger, R. Jhala, in:, Proceedings of the 12th International Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 351–365.","ama":"De Alfaro L, Henzinger TA, Jhala R. Compositional methods for probabilistic systems. In: <i>Proceedings of the 12th International Conference on on Concurrency Theory</i>. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:351-365. doi:<a href=\"https://doi.org/10.1007/3-540-44685-0_24\">10.1007/3-540-44685-0_24</a>","mla":"De Alfaro, Luca, et al. “Compositional Methods for Probabilistic Systems.” <i>Proceedings of the 12th International Conference on on Concurrency Theory</i>, vol. 2154, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 351–65, doi:<a href=\"https://doi.org/10.1007/3-540-44685-0_24\">10.1007/3-540-44685-0_24</a>.","ista":"De Alfaro L, Henzinger TA, Jhala R. 2001. Compositional methods for probabilistic systems. Proceedings of the 12th International Conference on on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 2154, 351–365.","ieee":"L. De Alfaro, T. A. Henzinger, and R. Jhala, “Compositional methods for probabilistic systems,” in <i>Proceedings of the 12th International Conference on on Concurrency Theory</i>, Aalborg, Denmark, 2001, vol. 2154, pp. 351–365.","apa":"De Alfaro, L., Henzinger, T. A., &#38; Jhala, R. (2001). Compositional methods for probabilistic systems. In <i>Proceedings of the 12th International Conference on on Concurrency Theory</i> (Vol. 2154, pp. 351–365). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/3-540-44685-0_24\">https://doi.org/10.1007/3-540-44685-0_24</a>","chicago":"De Alfaro, Luca, Thomas A Henzinger, and Ranjit Jhala. “Compositional Methods for Probabilistic Systems.” In <i>Proceedings of the 12th International Conference on on Concurrency Theory</i>, 2154:351–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001. <a href=\"https://doi.org/10.1007/3-540-44685-0_24\">https://doi.org/10.1007/3-540-44685-0_24</a>."},"date_created":"2018-12-11T12:09:51Z","abstract":[{"text":"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.","lang":"eng"}],"publication":"Proceedings of the 12th International Conference on on Concurrency Theory","year":"2001","date_updated":"2023-05-08T10:24:59Z","language":[{"iso":"eng"}],"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.","intvolume":"      2154","article_processing_charge":"No","month":"08"}