{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:48:06Z","timestamp":1762458486675},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540346944"},{"type":"electronic","value":"9783540346951"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11767954_1","type":"book-chapter","created":{"date-parts":[[2006,6,10]],"date-time":"2006-06-10T15:48:13Z","timestamp":1149954493000},"page":"1-15","source":"Crossref","is-referenced-by-count":19,"title":["Stochastic Reasoning About Channel-Based Component Connectors"],"prefix":"10.1007","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[]},{"given":"Verena","family":"Wolf","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Arbab, F.: Abstract behavior types: A foundation model for components and their composition. In: [15], pp. 33\u201370 (2003)","DOI":"10.1007\/978-3-540-39656-7_2"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129504004153","volume":"14","author":"F. Arbab","year":"2004","unstructured":"Arbab, F.: Reo: A channel-based coordination model for component composition. Mathematical Structures in Computer Science\u00a014(3), 1\u201338 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"key":"1_CR3","volume-title":"Proc.\u00a0SEFM 2004","author":"F. Arbab","year":"2004","unstructured":"Arbab, F., Baier, C., de Boer, F., Rutten, J.: Models and temporal logics for timed component connectors. In: Proc.\u00a0SEFM 2004. IEEE CS Press, Los Alamitos (2004)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Arbab, F., Baier, C., Rutten, J.J.M.M., Sirjani, M.: Modeling component connectors in reo by constraint automata. Science of Computer Programming, special issue on Foundations of Coordination Languages and Software Architectures (to appear, 2005)","DOI":"10.1016\/j.scico.2005.10.008"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-40020-2_2","volume-title":"Recent Trends in Algebraic Development Techniques","author":"F. Arbab","year":"2003","unstructured":"Arbab, F., Rutten, J.J.M.M.: A coinductive calculus of component connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol.\u00a02755, pp. 34\u201355. Springer, Heidelberg (2003)"},{"issue":"10","key":"1_CR6","first-page":"1718","volume":"11","author":"C. Baier","year":"2005","unstructured":"Baier, C.: Probabilistic models for reo connector circuits. Journal of Universal Computer Science\u00a011(10), 1718\u20131748 (2005)","journal-title":"Journal of Universal Computer Science"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-24730-2_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C. Baier","year":"2004","unstructured":"Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time markov decision processes. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 61\u201376. Springer, Heidelberg (2004) (Full version to appear in Theoretical Computer Science)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-540-45187-7_32","volume-title":"CONCUR 2003 - Concurrency Theory","author":"C. Baier","year":"2003","unstructured":"Baier, C., Hermanns, H., Katoen, J.-P., Wolf, V.: Comparative branching time semantics for Markov chains. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 492\u2013507. Springer, Heidelberg (2003)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/3-540-61604-7_63","volume-title":"CONCUR \u201996: Concurrency Theory","author":"M. Bernardo","year":"1996","unstructured":"Bernardo, M., Gorrieri, R.: Extended Markovian process algebra. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 315\u2013330. Springer, Heidelberg (1996)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-45232-4_8","volume-title":"Computer Performance Evaluations. Modelling Techniques and Tools","author":"H. Bohnenkamp","year":"2003","unstructured":"Bohnenkamp, H., Hermanns, H., Katoen, J.-P., Klaren, R.: The modest modeling tool and its implementation. In: Kemper, P., Sanders, W.H. (eds.) TOOLS 2003. LNCS, vol.\u00a02794, pp. 116\u2013133. Springer, Heidelberg (2003)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Bravetti, M.: Revisiting interactive Markov chains. In: Proc. Models for Time-Critical Systems. Electr. Notes Theor. Comput. Sci., vol.\u00a068(5) (2003)","DOI":"10.1016\/S1571-0661(04)80520-6"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.2307\/3215235","volume":"31","author":"P. Buchholz","year":"1994","unstructured":"Buchholz, P.: Exact and ordinary lumpability in finite markov chains. Journal of Applied Probability\u00a031, 59\u201375 (1994)","journal-title":"Journal of Applied Probability"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/234528.234732","volume":"28","author":"P. Ciancarini","year":"1996","unstructured":"Ciancarini, P.: Coordination models and languages as software integrators. ACM Comput. Surv.\u00a028(2), 300\u2013302 (1996)","journal-title":"ACM Comput. Surv."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/11925040_2","volume-title":"Leveraging Applications of Formal Methods","author":"D. Clarke","year":"2006","unstructured":"Clarke, D., Costa, D., Arbab, F.: Modelling coordination in biological systems. In: Margaria, T., Steffen, B. (eds.) ISoLA 2004. LNCS, vol.\u00a04313, pp. 9\u201325. Springer, Heidelberg (2006)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Methods for Components and Objects","year":"2003","unstructured":"de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.): FMCO 2002. LNCS, vol.\u00a02852. Springer, Heidelberg (2003)"},{"issue":"5","key":"1_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.entcs.2004.11.040","volume":"128","author":"A. Pierro Di","year":"2005","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Continuous-time probabilistic klaim. Electr. Notes Theor. Comput. Sci.\u00a0128(5), 27\u201338 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"1_CR17","unstructured":"Diakov, N., Arbab, F.: Compositional construction of web services using Reo. In: Proc. International Workshop on Web Services: Modeling, Architecture and Infrastructure (ICEIS 2004), Porto, Portugal, April 13-14 (2004)"},{"issue":"3","key":"1_CR18","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/moor.1040.0089","volume":"29","author":"E. Feinberg","year":"2004","unstructured":"Feinberg, E.: Continuous time discounted jump markov decision processes: A discrete-event approach. Math. Oper. Res.\u00a029(3), 492\u2013524 (2004)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/129630.129635","volume":"35","author":"D. Gelernter","year":"1992","unstructured":"Gelernter, D., Carriero, N.: Coordination languages and their significance. Commun. ACM\u00a035(2), 97\u2013107 (1992)","journal-title":"Commun. ACM"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45804-2","volume-title":"Interactive Markov Chains","author":"H. Hermanns","year":"2002","unstructured":"Hermanns, H.: Interactive Markov Chains. LNCS, vol.\u00a02428. Springer, Heidelberg (2002)"},{"key":"1_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569951","volume-title":"A compositional approach to performance modelling","author":"J. Hillston","year":"1996","unstructured":"Hillston, J.: A compositional approach to performance modelling. Cambridge University Press, Cambridge (1996)"},{"key":"1_CR22","volume-title":"Denumerable Markov Chains","author":"J.G. Kemeny","year":"1966","unstructured":"Kemeny, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov Chains. D. Van Nostrand Co., Princeton (1966)"},{"key":"1_CR23","series-title":"Prentice Hall International Series in Computer Science","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)"},{"issue":"9","key":"1_CR24","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/130994.131005","volume":"35","author":"O. Nierstrasz","year":"1992","unstructured":"Nierstrasz, O., Gibbs, S., Tsichritzis, D.: Component-oriented software development. Commun. ACM\u00a035(9), 160\u2013165 (1992)","journal-title":"Commun. ACM"},{"volume-title":"Coordination of Internet Agents: Models, Technologies, and Applications","year":"2001","key":"1_CR25","unstructured":"Omicini, A., Zambonelli, F., Klusch, M., Tolksdorf, R. (eds.): Coordination of Internet Agents: Models, Technologies, and Applications. Springer, Heidelberg (2001)"},{"issue":"2","key":"1_CR26","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0304-3975(00)00096-7","volume":"253","author":"P. Panangaden","year":"2001","unstructured":"Panangaden, P.: Measure and probability for concurrency theorists. Theoretical Computer Science\u00a0253(2), 287\u2013309 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"7","key":"1_CR27","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1093\/comjnl\/38.7.578","volume":"38","author":"C. Priami","year":"1995","unstructured":"Priami, C.: Stochastic pi-calculus. Comput. J.\u00a038(7), 578\u2013589 (1995)","journal-title":"Comput. J."},{"key":"1_CR28","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes\u2014Discrete Stochastic Dynamic Programming","author":"M.L. Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes\u2014Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York (1994)"},{"key":"1_CR29","first-page":"73","volume-title":"[27], ch. 5","author":"J.J.M.M. Rutten","year":"2004","unstructured":"Rutten, J.J.M.M.: Component connectors. In: [27], ch. 5, pp. 73\u201387. Oxford University Press, Oxford (2004)"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Wolf, V., Baier, C., Majster-Cederbaum, M.: Trace semantics for stochastic systems with nondeterminism. In: Proc.\u00a0QAPL (to appear, 2006)","DOI":"10.1016\/j.entcs.2006.07.019"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11767954_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T17:57:41Z","timestamp":1683482261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11767954_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540346944","9783540346951"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11767954_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}