{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:39:43Z","timestamp":1787495983677,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540407539","type":"print"},{"value":"9783540451877","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45187-7_14","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T18:38:49Z","timestamp":1277491129000},"page":"208-221","source":"Crossref","is-referenced-by-count":22,"title":["Compositionality for Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Nancy","family":"Lynch","sequence":"first","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":"14_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, Available as Technical Report MIT\/LCS\/TR- 632 (May 1994)","DOI":"10.1007\/3-540-57529-4_72"},{"key":"14_CR2","first-page":"266","volume-title":"Proceedings 6th Annual Symposium on Logic in Computer Science","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Jonsson, B.: Specification and refinement of probabilistic processes. In: Proceedings 6th Annual Symposium on Logic in Computer Science, Amsterdam, pp. 266\u2013277. IEEE Press, Los Alamitos (1991)"},{"key":"14_CR3","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, August 1994, pp. 314\u2013323 (1994)","DOI":"10.1145\/197917.198117"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Segala, R., Vaandrager, F.W.: Compositionality for probabilistic automata. Technical Report MIT-LCS-TR-907, MIT, Laboratory for Computer Science (2003)","DOI":"10.1007\/978-3-540-45187-7_14"},{"issue":"3","key":"14_CR5","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":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1995.1134","volume":"121","author":"N.A. Lynch","year":"1995","unstructured":"Lynch, N.A., Vaandrager, F.W.: Forward and backward simulations, I: Untimed systems. Information and Computation\u00a0121(2), 214\u2013233 (1995)","journal-title":"Information and Computation"},{"issue":"3","key":"14_CR7","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":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/3-540-60218-6_17","volume-title":"CONCUR \u201995 Concurrency Theory","author":"R. Segala","year":"1995","unstructured":"Segala, R.: Compositional trace\u2013based semantics for probabilistic automata. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 234\u2013248. Springer, Heidelberg (1995)"},{"key":"14_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, Available as Technical Report MIT\/LCS\/TR-676 (June 1995)"},{"issue":"2","key":"14_CR10","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing\u00a02(2), 250\u2013273 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"14_CR11","unstructured":"Stoelinga, M.I.A.: Alea jacta est: Verification of Probabilistic, Real-Time and Parametric Systems. PhD thesis, University of Nijmegen (April 2002)"},{"key":"14_CR12","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":"14_CR13","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":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-45061-0_38","volume-title":"Automata, Languages and Programming","author":"M.I.A. Stoelinga","year":"2003","unstructured":"Stoelinga, M.I.A., Vaandrager, F.W.: A testing scenario for probabilistic automata. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 407\u2013418. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2003 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45187-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:15:34Z","timestamp":1558278934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45187-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407539","9783540451877"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45187-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}