{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T09:41:25Z","timestamp":1782466885657,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642182747","type":"print"},{"value":"9783642182754","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18275-4_23","type":"book-chapter","created":{"date-parts":[[2011,1,17]],"date-time":"2011-01-17T00:06:38Z","timestamp":1295222798000},"page":"324-339","source":"Crossref","is-referenced-by-count":27,"title":["Abstract Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Delahaye","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Axel","family":"Legay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikkel L.","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Falak","family":"Sher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"W\u0105sowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-03466-4_7","volume-title":"Theoretical Aspects of Computing - ICTAC 2009","author":"N. Bene\u0161","year":"2009","unstructured":"Bene\u0161, N., K\u0159et\u00ednsk\u00fd, J., Larsen, K.G., Srba, J.: Checking thorough refinement on modal transition systems is EXPTIME-complete. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol.\u00a05684, pp. 112\u2013126. Springer, Heidelberg (2009)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Caillaud, B., Delahaye, B., Larsen, K.G., Legay, A., Pedersen, M.L., W\u0105sowski, A.: Decision Problems for Interval Markov Chains (2010), http:\/\/www.cs.aau.dk\/~mikkelp\/doc\/IMCpaper.pdf (Research report)","DOI":"10.1007\/978-3-642-21254-3_21"},{"key":"23_CR3","volume-title":"QEST","author":"B. Caillaud","year":"2010","unstructured":"Caillaud, B., Delahaye, B., Larsen, K.G., Legay, A., Pedersen, M.L., W\u0105sowski, A.: Compositional design methodology with constraint Markov chains. In: QEST. IEEE, Los Alamitos (2010)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Caillaud, B., Delahaye, B., Larsen, K.G., Legay, A., Pedersen, M.L., W\u0105sowski, A.: Compositional design methodology with constraint Markov chains. Submitted to TCS. Elsevier, Amsterdam (2010)","DOI":"10.1109\/QEST.2010.23"},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10626-007-0032-1","volume":"18","author":"R. Canetti","year":"2008","unstructured":"Canetti, R., Cheung, L., Kaynar, D.K., Liskov, M., Lynch, N.A., Pereira, O., Segala, R.: Analyzing security protocols using time-bounded task-pioas. Discrete Event Dynamic Systems\u00a018(1), 111\u2013159 (2008)","journal-title":"Discrete Event Dynamic Systems"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-45694-5_25","volume-title":"CONCUR 2002 - Concurrency Theory","author":"S. Cattani","year":"2002","unstructured":"Cattani, S., Segala, R.: Decision algorithms for probabilistic bisimulation. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 371\u2013385. Springer, Heidelberg (2002)"},{"issue":"1-2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2006.07.033","volume":"365","author":"L. Cheung","year":"2006","unstructured":"Cheung, L., Lynch, N.A., Segala, R., Vaandrager, F.W.: Switched pioa: Parallel composition via distributed scheduling. TCS\u00a0365(1-2), 83\u2013108 (2006)","journal-title":"TCS"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Cheung, L., Stoelinga, M., Vaandrager, F.W.: A testing scenario for probabilistic processes. J. ACM\u00a054(6) (2007)","DOI":"10.1145\/1314690.1314693"},{"key":"23_CR9","series-title":"NATO Science Series: Mathematics, Physics, and Chemistry","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/1-4020-3532-2_3","volume-title":"Engineering Theories of Software-intensive Systems","author":"L. Alfaro de","year":"2005","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface-based design. In: Engineering Theories of Software-intensive Systems. NATO Science Series: Mathematics, Physics, and Chemistry, vol.\u00a0195, pp. 83\u2013104. Springer, Heidelberg (2005)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Delahaye, B., Katoen, J.-P., Larsen, K.G., Legay, A., Pedersen, M.L., Sher, F., W\u0105sowski, A.: Abstract probabilistic automata (2010), http:\/\/perso.bretagne.ens-cachan.fr\/~delahaye\/VMCAI11-long.pdf","DOI":"10.1109\/ACSD.2011.10"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/11691617_5","volume-title":"Model Checking Software","author":"H. Fecher","year":"2006","unstructured":"Fecher, H., Leucker, M., Wolf, V.: Don\u2019t know in probabilistic systems. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol.\u00a03925, pp. 71\u201388. Springer, Heidelberg (2006)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45739-9_21","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"D.N. Jansen","year":"2002","unstructured":"Jansen, D.N., Hermanns, H., Katoen, J.-P.: A probabilistic extension of uml statecharts. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol.\u00a02469, pp. 355\u2013374. Springer, Heidelberg (2002)"},{"key":"23_CR13","first-page":"266","volume-title":"LICS","author":"B. Jonsson","year":"1991","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: LICS, pp. 266\u2013277. IEEE, Los Alamitos (1991)"},{"key":"23_CR14","first-page":"266","volume-title":"LICS","author":"B. Jonsson","year":"1991","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: LICS, pp. 266\u2013277. IEEE, Los Alamitos (1991)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-73368-3_37","volume-title":"Computer Aided Verification","author":"J.-P. Katoen","year":"2007","unstructured":"Katoen, J.-P., Klink, D., Leucker, M., Wolf, V.: Three-valued abstraction for continuous-time markov chains. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 316\u2013329. Springer, Heidelberg (2007)"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-04368-0_16","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"J.-P. Katoen","year":"2009","unstructured":"Katoen, J.-P., Klink, D., Neuh\u00e4u\u00dfer, M.R.: Compositional abstraction for stochastic systems. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol.\u00a05813, pp. 195\u2013211. Springer, Heidelberg (2009)"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-71316-6_6","volume-title":"Programming Languages and Systems","author":"K.G. Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., W\u0105sowski, A.: Modal I\/O automata for interface and product line theories. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 64\u201379. Springer, Heidelberg (2007)"},{"key":"23_CR18","first-page":"203","volume-title":"LICS","author":"K.G. Larsen","year":"1988","unstructured":"Larsen, K.G., Thomsen, B.: A modal process logic. In: LICS, pp. 203\u2013210. IEEE, Los Alamitos (1988)"},{"key":"23_CR19","first-page":"232","volume-title":"AVMFSS","author":"K.G. Larsen","year":"1989","unstructured":"Larsen, K.G.: Modal specifications. In: AVMFSS, pp. 232\u2013246. Springer, Heidelberg (1989)"},{"key":"23_CR20","first-page":"294","volume-title":"QEST","author":"A. Parma","year":"2004","unstructured":"Parma, A., Segala, R.: Axiomatization of trace semantics for stochastic nondeterministic processes. In: QEST, pp. 294\u2013303. IEEE, Los Alamitos (2004)"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/1629335.1629348","volume-title":"EMSOFT","author":"J.-B. Raclet","year":"2009","unstructured":"Raclet, J.-B., Badouel, E., Benveniste, A., Caillaud, B., Legay, A., Passerone, R.: Modal interfaces: unifying interface automata and modal specifications. In: EMSOFT, pp. 87\u201396. ACM, New York (2009)"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11817949_5","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"R. Segala","year":"2006","unstructured":"Segala, R.: Probability and nondeterminism in operational models of concurrency. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 64\u201378. Springer, Heidelberg (2006)"},{"key":"23_CR23","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. NJC\u00a02, 250\u2013273 (1995)","journal-title":"NJC"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18275-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:39:34Z","timestamp":1559932774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18275-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642182747","9783642182754"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18275-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}