{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T05:40:12Z","timestamp":1794375612117,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540253044","type":"print"},{"value":"9783540318620","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31862-0_35","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:28:55Z","timestamp":1268382535000},"page":"494-510","source":"Crossref","is-referenced-by-count":8,"title":["Switched Probabilistic I\/O Automata"],"prefix":"10.1007","author":[{"given":"Ling","family":"Cheung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nancy","family":"Lynch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Segala","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, S.: Time optimal self-stabilizing spanning tree algorithms. Master\u2019s thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (May 1994), Available as Technical Report MIT\/LCS\/TR-632","DOI":"10.1007\/3-540-57529-4_72"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computing, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-44685-0_24","volume-title":"CONCUR 2001 - Concurrency Theory","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A., Jhala, R.: Compositional methods for probabilistic systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 351\u2013365. Springer, Heidelberg (2001)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Lincoln, P., Mitchell, J.C., Mitchell, M., Scedrov, A.: A probabilistic poly-time framework for protocol analysis. In: ACM Conference on Computer and Communications Security, pp. 112\u2013121 (1998)","DOI":"10.1145\/288090.288117"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Saias, I., Segala, R.: Proving time bounds for randomized distributed algorithms. In: Proceedings of the 13th Annual ACM Symposium on the Principles of Distributed Computing, Los Angeles, CA, pp. 314\u2013323 (August 1994)","DOI":"10.1145\/197917.198117"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-45187-7_14","volume-title":"CONCUR 2003 - Concurrency Theory","author":"N.A. Lynch","year":"2003","unstructured":"Lynch, N.A., Segala, R., Vaandrager, F.W.: Compositionality for probabilistic automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 208\u2013221. Springer, Heidelberg (2003)"},{"issue":"3","key":"35_CR7","first-page":"219","volume":"2","author":"N.A. Lynch","year":"1989","unstructured":"Lynch, N.A., Tuttle, M.R.: An introduction to input\/output automata. CWI Quarterly\u00a02(3), 219\u2013246 (1989)","journal-title":"CWI Quarterly"},{"issue":"3","key":"35_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/PL00008917","volume":"13","author":"A. Pogosyants","year":"2000","unstructured":"Pogosyants, A., Segala, R., Lynch, N.A.: Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing\u00a013(3), 155\u2013186 (2000)","journal-title":"Distributed Computing"},{"key":"35_CR9","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (June 1995), Available as Technical Report MIT\/LCS\/TR-676"},{"key":"35_CR10","first-page":"176","volume":"78","author":"M.I.A. Stoelinga","year":"2002","unstructured":"Stoelinga, M.I.A.: An introduction to probabilistic automata. Bulletin of the European Association for Theoretical Computer Science\u00a078, 176\u2013198 (2002)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-48778-6_4","volume-title":"Formal Methods for Real-Time and Probabilistic Systems","author":"M.I.A. Stoelinga","year":"1999","unstructured":"Stoelinga, M.I.A., Vaandrager, F.W.: Root contention in IEEE 1394. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol.\u00a01601, pp. 53\u201374. Springer, Heidelberg (1999)"},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24611-4_1","volume-title":"Validation of Stochastic Systems","author":"A. Sokolova","year":"2004","unstructured":"Sokolova, A., de Vink, E.P.: Probabilistic automata: System types, parallel composition and comparison. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol.\u00a02925, pp. 1\u201343. Springer, Heidelberg (2004)"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BFb0015029","volume-title":"CONCUR \u201994: Concurrency Theory","author":"S.-H. Wu","year":"1994","unstructured":"Wu, S.-H., Smolka, S.A., Stark, E.W.: Composition and behaviors of probabilistic i\/o automata. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 513\u2013528. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31862-0_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:30:03Z","timestamp":1605742203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31862-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253044","9783540318620"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31862-0_35","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b107116","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}