{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:26:06Z","timestamp":1725891966033},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357213"},{"type":"electronic","value":"9783642357220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35722-0_11","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T11:16:29Z","timestamp":1357298189000},"page":"149-163","source":"Crossref","is-referenced-by-count":1,"title":["Stuttering for Abstract Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Delahaye","sequence":"first","affiliation":[]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Axel","family":"Legay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2006.02.010","volume":"356","author":"S. Andova","year":"2006","unstructured":"Andova, S., Willemse, T.A.C.: Branching bisimulation for probabilistic systems: Characteristics and decidability. Theor. Comput. Sci.\u00a0356, 325\u2013355 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-63166-6_14","volume-title":"Computer Aided Verification","author":"C. Baier","year":"1997","unstructured":"Baier, C., Hermanns, H.: Weak Bisimulation for Fully Probabilistic Processes. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 119\u2013130. Springer, Heidelberg (1997)"},{"key":"11_CR3","first-page":"1","volume":"22","author":"S.S. Bauer","year":"2012","unstructured":"Bauer, S.S., Juhl, L., Larsen, K.G., Legay, A., Srba, J.: Extending modal transition systems with structured labels. MSCS\u00a022, 1\u201337 (2012)","journal-title":"MSCS"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-12002-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S.S. Bauer","year":"2010","unstructured":"Bauer, S.S., Mayer, P., Schroeder, A., Hennicker, R.: On Weak Modal Compatibility, Refinement, and the MIO Workbench. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 175\u2013189. Springer, Heidelberg (2010)"},{"key":"11_CR5","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. In: QEST. IEEE Computer (2010)","DOI":"10.1109\/QEST.2010.23"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"4373","DOI":"10.1016\/j.tcs.2011.05.010","volume":"412","author":"B. Caillaud","year":"2011","unstructured":"Caillaud, B., Delahaye, B., Larsen, K.G., Legay, A., Pedersen, M.L., Wasowski, A.: Constraint markov chains. Theor. Comput. Sci.\u00a0412, 4373\u20134404 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: FSE, pp. 109\u2013120. ACM Press (2001)","DOI":"10.1145\/503271.503226"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-18275-4_23","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"B. Delahaye","year":"2011","unstructured":"Delahaye, B., Katoen, J.-P., Larsen, K.G., Legay, A., Pedersen, M.L., Sher, F., W\u0105sowski, A.: Abstract Probabilistic Automata. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol.\u00a06538, pp. 324\u2013339. Springer, Heidelberg (2011)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Delahaye, B., Larsen, K.G., Legay, A., Pedersen, M.L., W\u0105sowski, A.: APAC: a tool for reasoning about Abstract Probabilistic Automata. In: QEST. IEEE Computer (2011)","DOI":"10.1109\/QEST.2011.28"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Delahaye, B., Larsen, K.G., Legay, A., Pedersen, M.L., W\u0105sowski, A.: New Results on Constraint Markov Chains. Performance Evaluation (2011) (to appear)","DOI":"10.1016\/j.peva.2011.11.003"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Delahaye, B., Katoen, J.-P., Larsen, K.G., Legay, A., Pedersen, M.L., Sher, F., Wasowski, A.: New Results on Abstract Probabilistic Automata. In: ACSD. IEEE Computer (2011)","DOI":"10.1109\/ACSD.2011.10"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Delahaye, B., Larsen, K.G., Legay, A.: Stuttering in abstract probabilistic automata (long version). Technical report (2012), http:\/\/delahaye.benoit.free.fr","DOI":"10.1007\/978-3-642-35722-0_11"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-03466-4_14","volume-title":"Theoretical Aspects of Computing - ICTAC 2009","author":"D. Fischbein","year":"2009","unstructured":"Fischbein, D., Braberman, V., Uchitel, S.: A Sound Observational Semantics for Modal Transition Systems. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol.\u00a05684, pp. 215\u2013230. Springer, Heidelberg (2009)"},{"key":"11_CR14","unstructured":"Georgievska, S.: Probability and Hiding in Concurrent Processes. PhD thesis, Eindhoven University of Technology (2011)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-15784-4_18","volume-title":"Computer Performance Engineering","author":"S. Georgievska","year":"2010","unstructured":"Georgievska, S., Andova, S.: Composing Systems While Preserving Probabilities. In: Aldini, A., Bernardo, M., Bononi, L., Cortellessa, V. (eds.) EPEW 2010. LNCS, vol.\u00a06342, pp. 268\u2013283. Springer, Heidelberg (2010)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-28540-0_10","volume-title":"Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance","author":"S. Georgievska","year":"2012","unstructured":"Georgievska, S., Andova, S.: Probabilistic CSP: Preserving the Laws via Restricted Schedulers. In: Schmitt, J.B. (ed.) MMB & DFT 2012. LNCS, vol.\u00a07201, pp. 136\u2013150. Springer, Heidelberg (2012)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-04081-8_23","volume-title":"CONCUR 2009 - Concurrency Theory","author":"S. Giro","year":"2009","unstructured":"Giro, S., D\u2019Argenio, P.R., Ferrer Fioriti, L.M.: Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 338\u2013353. Springer, Heidelberg (2009)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11813040_1","volume-title":"FM 2006: Formal Methods","author":"T.A. Henzinger","year":"2006","unstructured":"Henzinger, T.A., Sifakis, J.: The Embedded Systems Design Challenge. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol.\u00a04085, pp. 1\u201315. Springer, Heidelberg (2006)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(00)00305-4","volume":"274","author":"H. Hermanns","year":"2002","unstructured":"Hermanns, H., Herzog, U., Katoen, J.: Process algebra for performance evaluation. TCS\u00a0274, 43\u201387 (2002)","journal-title":"TCS"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-52148-8_19","volume-title":"Automatic Verification Methods for Finite State Systems","author":"K.G. Larsen","year":"1990","unstructured":"Larsen, K.G.: Modal Specifications. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 232\u2013246. Springer, Heidelberg (1990)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/BFb0084809","volume-title":"CONCUR \u201992","author":"K.G. Larsen","year":"1992","unstructured":"Larsen, K.G., Skou, A.: Compositional Verification of Probabilistic Processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 456\u2013471. Springer, Heidelberg (1992)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. In: POPL, pp. 344\u2013352 (1989)","DOI":"10.1145\/75277.75307"},{"key":"11_CR23","first-page":"1","volume":"3","author":"G. Lowe","year":"1993","unstructured":"Lowe, G.: Representing nondeterministic and probabilistic behaviour in reactive processes. Formal Asp. Comput.\u00a03, 1 (1993)","journal-title":"Formal Asp. Comput."},{"key":"11_CR24","unstructured":"Lynch, N., Tuttle, M.R.: An introduction to Input\/Output automata. CWI-Quarterly 2 (1989)"},{"key":"11_CR25","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. Lynch","year":"2003","unstructured":"Lynch, N., Segala, R., Vaandrager, F.: Compositionality for Probabilistic Automata. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 208\u2013221. Springer, Heidelberg (2003)"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.entcs.2006.11.040","volume":"174","author":"S. Mitra","year":"2007","unstructured":"Mitra, S., Lynch, N.A.: Proving approximate implementations for probabilistic i\/o automata. Electr. Notes Theor. Comput. Sci.\u00a0174, 71\u201393 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Morgan, C., McIver, A., Seidel, K., Sanders, J.W.: Refinement-oriented probability for CSP. Formal Asp. Comput. 8 (1996)","DOI":"10.1007\/BF01213492"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-44618-4_25","volume-title":"CONCUR 2000 - Concurrency Theory","author":"A. Philippou","year":"2000","unstructured":"Philippou, A., Lee, I., Sokolsky, O.: Weak Bisimulation for Probabilistic Systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 334\u2013349. Springer, Heidelberg (2000)"},{"key":"11_CR29","unstructured":"Raclet, J.-B.: Quotient de sp\u00e9cifications pour la r\u00e9utilisation de composants. PhD thesis, Universit\u00e9 de Rennes I (2007) (in French)"},{"key":"11_CR30","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-time Systems. PhD thesis, MIT (1995)"},{"key":"11_CR31","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"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The Linear Time - Branching Time Spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35722-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,5]],"date-time":"2022-02-05T07:38:08Z","timestamp":1644046688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35722-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357213","9783642357220"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35722-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}