{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:17:49Z","timestamp":1753521469996},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402289"},{"type":"electronic","value":"9783642402296"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-40229-6_17","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:47:40Z","timestamp":1374529660000},"page":"243-257","source":"Crossref","is-referenced-by-count":20,"title":["Confluence Reduction for Markov Automata"],"prefix":"10.1007","author":[{"given":"Mark","family":"Timmer","sequence":"first","affiliation":[]},{"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[]},{"given":"Mari\u00eblle I. A.","family":"Stoelinga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. John Wiley & Sons, Inc. (1994)"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/190.191","volume":"2","author":"M. Ajmone Marsan","year":"1984","unstructured":"Ajmone Marsan, M., Conte, G., Balbo, G.: A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems. ACM Transactions on Computer Systems\u00a02(2), 93\u2013122 (1984)","journal-title":"ACM Transactions on Computer Systems"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Baier, C., D\u2019Argenio, P.R., Gr\u00f6\u00dfer, M.: Partial order reduction for probabilistic branching time. In: QAPL. ENTCS, vol.\u00a0153(2), pp. 97\u2013116 (2006)","DOI":"10.1016\/j.entcs.2005.10.034"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Baier, C., Gr\u00f6\u00dfer, M., Ciesinski, F.: Partial order reduction for probabilistic systems. In: QEST, pp. 230\u2013239 (2004)","DOI":"10.1109\/QEST.2004.1348037"},{"key":"17_CR5","unstructured":"Belinfante, A., Rensink, A.: Publishing your prototype tool on the web: PUPTOL, a framework. Technical Report TR-CTIT-13-15, Centre for Telematics and Information Technology, University of Twente (2013)"},{"key":"17_CR6","unstructured":"Blom, S.C.C.: Partial \u03c4-confluence for efficient state space generation. Technical Report SEN-R0123, CWI, Amsterdam (2001)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-45657-0_50","volume-title":"Computer Aided Verification","author":"S.C.C. Blom","year":"2002","unstructured":"Blom, S.C.C., van de Pol, J.C.: State space reduction by proving confluence. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 596\u2013609. Springer, Heidelberg (2002)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Boudali, H., Crouzen, P., Haverkort, B.R., Kuntz, M., Stoelinga, M.I.A.: Architectural dependability evaluation with arcade. In: DSN, pp. 512\u2013521 (2008)","DOI":"10.1109\/DSN.2008.4630122"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1109\/TDSC.2009.45","volume":"7","author":"H. Boudali","year":"2010","unstructured":"Boudali, H., Crouzen, P., Stoelinga, M.I.A.: A rigorous, compositional, and extensible framework for dynamic fault tree analysis. IEEE Transactions on Dependable and Secure Compututing\u00a07(2), 128\u2013143 (2010)","journal-title":"IEEE Transactions on Dependable and Secure Compututing"},{"issue":"5","key":"17_CR10","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1093\/comjnl\/bxq024","volume":"54","author":"M. Bozzano","year":"2011","unstructured":"Bozzano, M., Cimatti, A., Katoen, J.-P., Nguyen, V.Y., Noll, T., Roveri, M.: Safety, dependability and performance analysis of extended AADL models. The Computer Journal\u00a054(5), 754\u2013775 (2011)","journal-title":"The Computer Journal"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"D\u2019Argenio, P.R., Niebert, P.: Partial order reduction on concurrent probabilistic programs. In: QEST, pp. 240\u2013249 (2004)","DOI":"10.1109\/QEST.2004.1348038"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-22012-8_24","volume-title":"Automata, Languages and Programming","author":"Y. Deng","year":"2011","unstructured":"Deng, Y., Hennessy, M.: On the semantics of Markov automata. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 307\u2013318. Springer, Heidelberg (2011)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-15375-4_3","volume-title":"CONCUR 2010 - Concurrency Theory","author":"C. Eisentraut","year":"2010","unstructured":"Eisentraut, C., Hermanns, H., Zhang, L.: Concurrency and composition in a stochastic world. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 21\u201339. Springer, Heidelberg (2010)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. In: LICS, pp. 342\u2013351 (2010)","DOI":"10.1109\/LICS.2010.41"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Fokkink, W., Pang, J.: Simplifying Itai-Rodeh leader election for anonymous rings. In: AVoCS. ENTCS, vol.\u00a0128(6), pp. 53\u201368 (2005)","DOI":"10.1016\/j.entcs.2005.04.004"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems","author":"P. Godefroid","year":"1996","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol.\u00a01032. Springer, Heidelberg (1996)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-642-40196-1_5","volume-title":"QEST 2013","author":"D. Guck","year":"2013","unstructured":"Guck, D., Hatefi, H., Hermanns, H., Katoen, J.-P., Timmer, M.: Modelling, reduction and analysis of Markov automata. In: Joshi, K., Siegle, M., Stoelinga, M., D\u2019Argenio, P.R. (eds.) QEST 2013. LNCS, vol.\u00a08054, pp. 55\u201371. Springer, Heidelberg (2013)"},{"key":"17_CR18","unstructured":"Hansen, H., Timmer, M.: A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time. In: TCS (to appear, 2013)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-38088-4_23","volume-title":"NASA Formal Methods","author":"A. Hartmanns","year":"2013","unstructured":"Hartmanns, A., Timmer, M.: On-the-fly confluence detection for statistical model checking. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol.\u00a07871, pp. 337\u2013351. Springer, Heidelberg (2013)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Katoen, J.-P.: GSPNs revisited: Simple semantics and new analysis algorithms. In: ACSD, pp. 6\u201311 (2012)","DOI":"10.1109\/ACSD.2012.30"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Timmer, M.: SCOOP: A tool for symbolic optimisations of probabilistic processes. In: QEST, pp. 149\u2013150 (2011)","DOI":"10.1109\/QEST.2011.27"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-32940-1_26","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"M. Timmer","year":"2012","unstructured":"Timmer, M., Katoen, J.-P., van de Pol, J.C., Stoelinga, M.I.A.: Efficient modelling and generation of Markov automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 364\u2013379. Springer, Heidelberg (2012)"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-19835-9_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Timmer","year":"2011","unstructured":"Timmer, M., Stoelinga, M.I.A., van de Pol, J.C.: Confluence reduction for probabilistic systems. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol.\u00a06605, pp. 311\u2013325. Springer, Heidelberg (2011)"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Timmer, M., van de Pol, J.C., Stoelinga, M.I.A.: Confluence reduction for Markov automata (extended version). Technical Report TR-CTIT-13-14, Centre for Telematics and Information Technology, University of Twente (2013)","DOI":"10.1007\/978-3-642-40229-6_17"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","first-page":"491","volume-title":"Advances in Petri Nets 1989","author":"A. Valmari","year":"1990","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) APN 1989. LNCS, vol.\u00a0424, pp. 491\u2013515. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40229-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:09:11Z","timestamp":1558303751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40229-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402289","9783642402296"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40229-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}