{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T08:46:12Z","timestamp":1753519572788,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329395"},{"type":"electronic","value":"9783642329401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32940-1_26","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T20:47:02Z","timestamp":1346532422000},"page":"364-379","source":"Crossref","is-referenced-by-count":30,"title":["Efficient Modelling and Generation of Markov Automata"],"prefix":"10.1007","author":[{"given":"Mark","family":"Timmer","sequence":"first","affiliation":[]},{"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[]},{"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[]},{"given":"Mari\u00eblle I. A.","family":"Stoelinga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Boudali, H., Crouzen, P., Stoelinga, M.I.A.: Dynamic fault tree analysis using Input\/Output interactive Markov chains. In: DSN, pp. 708\u2013717 (2007)","DOI":"10.1109\/DSN.2007.37"},{"issue":"5","key":"26_CR2","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":"26_CR3","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":"26_CR4","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":"26_CR5","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":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-19835-9_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Garavel","year":"2011","unstructured":"Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol.\u00a06605, pp. 372\u2013387. Springer, Heidelberg (2011)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Ponse, A.: The syntax and semantics of \u03bcCRL. In: Algebra of Communicating Processes, Workshops in Computing, pp. 26\u201362 (1995)","DOI":"10.1007\/978-1-4471-2120-6_2"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45804-2","volume-title":"Interactive Markov Chains","author":"H. Hermanns","year":"2002","unstructured":"Hermanns, H.: Interactive Markov Chains. LNCS, vol.\u00a02428. Springer, Heidelberg (2002)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Hillston, J.: Process algebras for quantitative analysis. In: LICS, pp. 239\u2013248 (2005)","DOI":"10.1109\/LICS.2005.35"},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2011.07.021","volume":"413","author":"J.P. Katoen","year":"2012","unstructured":"Katoen, J.P., van de Pol, J., Stoelinga, M., Timmer, M.: A linear process-algebraic format with data for probabilistic automata. TCS\u00a0413(1), 36\u201357 (2012)","journal-title":"TCS"},{"key":"26_CR11","unstructured":"Latella, D., Massink, M., de Vink, E.P.: Bisimulation of labeled state-to-function transition systems of stochastic process languages. In: ACCAT (to appear, 2012)"},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/190.191","volume":"2","author":"M.A. Marsan","year":"1984","unstructured":"Marsan, M.A., 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"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01843570","volume":"1","author":"A. Pnueli","year":"1986","unstructured":"Pnueli, A., Zuck, L.D.: Verification of multiprocess probabilistic protocols. Distributed Computing\u00a01(1), 53\u201372 (1986)","journal-title":"Distributed Computing"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-04761-9_5","volume-title":"Automated Technology for Verification and Analysis","author":"J. Pol van de","year":"2009","unstructured":"van de Pol, J., Timmer, M.: State Space Reduction of Linear Processes Using Control Flow Reconstruction. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol.\u00a05799, pp. 54\u201368. Springer, Heidelberg (2009)"},{"issue":"7","key":"26_CR15","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1093\/comjnl\/38.7.578","volume":"38","author":"C. Priami","year":"1995","unstructured":"Priami, C.: Stochastic pi-calculus. The Computer Journal\u00a038(7), 578\u2013589 (1995)","journal-title":"The Computer Journal"},{"key":"26_CR16","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. Ph.D. thesis, MIT (1995)"},{"issue":"6","key":"26_CR17","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1287\/mnsc.37.6.667","volume":"37","author":"M.M. Srinivasan","year":"1991","unstructured":"Srinivasan, M.M.: Nondeterministic polling systems. Management Science\u00a037(6), 667\u2013681 (1991)","journal-title":"Management Science"},{"key":"26_CR18","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 EATCS\u00a078, 176\u2013198 (2002)","journal-title":"Bulletin of the EATCS"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Timmer, M., Katoen, J.P., van de Pol, J., Stoelinga, M.I.A.: Efficient modelling and generation of Markov automata (extended version). Tech. Rep. TR-CTIT-12-16, CTIT, University of Twente (2012)","DOI":"10.1007\/978-3-642-32940-1_26"},{"key":"26_CR20","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., van de Pol, J.: 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":"26_CR21","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"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2012 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32940-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T18:06:27Z","timestamp":1744049187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32940-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329395","9783642329401"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32940-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}