{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:02:35Z","timestamp":1742983355465,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319222639"},{"type":"electronic","value":"9783319222646"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22264-6_11","type":"book-chapter","created":{"date-parts":[[2015,8,21]],"date-time":"2015-08-21T10:33:29Z","timestamp":1440153209000},"page":"160-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lumping-Based Equivalences in Markovian Automata and Applications to Product-Form Analyses"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Marin","sequence":"first","affiliation":[]},{"given":"Sabina","family":"Rossi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,22]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.peva.2010.09.002","volume":"68","author":"S Baarir","year":"2011","unstructured":"Baarir, S., Beccuti, M., Dutheillet, C., Franceschinis, G., Haddad, S.: Lumping partially symmetrical stochastic models. Perf. Eval. 68(1), 21\u201344 (2011)","journal-title":"Perf. Eval."},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ic.2005.03.001","volume":"200","author":"C Baier","year":"2005","unstructured":"Baier, C., Katoen, J.-P., Hermanns, H.: Comparative branching-time semantics for markov chains. Inf. Comput. 200(2), 149\u2013214 (2005)","journal-title":"Inf. Comput."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-72522-0_2","volume-title":"Formal Methods for Performance Evaluation","author":"S Balsamo","year":"2007","unstructured":"Balsamo, S., Marin, A.: Queueing networks. In: Bernardo, M., Hillston, J. (eds.) SFM 2007. LNCS, vol. 4486, pp. 34\u201382. Springer, Heidelberg (2007)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-642-30782-9_15","volume-title":"Analytical and Stochastic Modeling Techniques and Applications","author":"S Balsamo","year":"2012","unstructured":"Balsamo, S., Dei Rossi, G.-L., Marin, A.: Lumping and reversed processes in cooperating automata. In: Al-Begain, K., Fiems, D., Vincent, J.-M. (eds.) ASMTA 2012. LNCS, vol. 7314, pp. 212\u2013226. Springer, Heidelberg (2012)"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321879.321887","volume":"22","author":"F Baskett","year":"1975","unstructured":"Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.G.: Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22(2), 248\u2013260 (1975)","journal-title":"J. ACM"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bernardo, M.: Weak Markovian bisimulation congruences and exact CTMC-level aggregations for concurrent processes. In: Proceedings of the 10th Workshop on Quantitative Aspects of Programming Languages and Systems (QALP12), pp. 122\u2013136 (2012)","DOI":"10.4204\/EPTCS.85.9"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00127-8","volume":"202","author":"M Bernardo","year":"1998","unstructured":"Bernardo, M., Gorrieri, R.: A tutorial on empa: a theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theo. Comput. Sci. 202, 1\u201354 (1998)","journal-title":"Theo. Comput. Sci."},{"issue":"5","key":"11_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S1571-0661(04)80520-6","volume":"68","author":"M Bravetti","year":"2003","unstructured":"Bravetti, M.: Revisiting interactive markov chains. Electr. Notes Theor. Comput. Sci. 68(5), 65\u201384 (2003)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.2307\/3215235","volume":"31","author":"P Buchholz","year":"1994","unstructured":"Buchholz, P.: Exact and ordinary lumpability in finite markov chains. J. Appl. Probab. 31, 59\u201375 (1994)","journal-title":"J. Appl. Probab."},{"issue":"1\u20132","key":"11_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(98)00169-8","volume":"215","author":"P Buchholz","year":"1999","unstructured":"Buchholz, P.: Exact performance equivalence: an equivalence relation for stochastic automata. Theor. Comput. Sci. 215(1\u20132), 263\u2013287 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/S0304-3975(02)00375-4","volume":"290","author":"PG Harrison","year":"2003","unstructured":"Harrison, P.G.: Turning back time in markovian process algebra. Theo. Comput. Sci. 290(3), 1947\u20131986 (2003)","journal-title":"Theo. Comput. Sci."},{"key":"11_CR12","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. Springer, Heidelberg (2002)"},{"issue":"1\u20132","key":"11_CR13","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.P.: Process algebra for performance evaluation. Theor. Comput. Sci. 274(1\u20132), 43\u201387 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569951","volume-title":"A Compositional Approach to Performance Modelling","author":"J Hillston","year":"1996","unstructured":"Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge Press, Cambridge (1996)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Hillston, J., Marin, A., Piazza, C., Rossi, S.: Contextual lumpability. In: Proceedings of Valuetools 2013 Conference. ACM Press (2013)","DOI":"10.4108\/icst.valuetools.2013.254408"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"A Skou","year":"1991","unstructured":"Skou, A., Larsen, K.G.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"11_CR17","volume-title":"Reversibility and Stochastic Networks","author":"F Kelly","year":"1979","unstructured":"Kelly, F.: Reversibility and Stochastic Networks. Wiley, New York (1979)"},{"key":"11_CR18","volume-title":"Finite Markov Chains","author":"JG Kemeny","year":"1976","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1976)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Le Boudec, J.Y.: A BCMP extension to multiserver stations with concurrent classes of customers. In: SIGMETRICS 1986\/PERFORMANCE 1986: Proceedings of the 1986 ACM SIGMETRICS International Conference on Computer Performance Modelling, Measurement and Evaluation, pp. 78\u201391. ACM Press, New York, NY (1986)","DOI":"10.1145\/317531.317541"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Marin, A., Rossi, S.: Autoreversibility: exploiting symmetries in Markov chains. In: Proceedings of MASCOTS 2013, pp. 151\u2013160. IEEE Computer Society (2013)","DOI":"10.1109\/MASCOTS.2013.23"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Marin, A., Vigliotti, M.G.: A general result for deriving product-form solutions of Markovian models. In: Proceedings of First Joint WOSP\/SIPEW International Conference on Performance Engineering, pp. 165\u2013176. ACM, San Jos\u00e8, CA, USA (2010)","DOI":"10.1145\/1712605.1712632"},{"issue":"9","key":"11_CR22","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1109\/TC.1982.1676110","volume":"31","author":"MK Molloy","year":"1982","unstructured":"Molloy, M.K.: Performance analysis using stochastic petri nets. IEEE Trans. on Comput. 31(9), 913\u2013917 (1982)","journal-title":"IEEE Trans. on Comput."},{"issue":"6","key":"11_CR23","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/317786.317819","volume":"13","author":"B Plateau","year":"1985","unstructured":"Plateau, B.: On the stochastic structure of parallelism and synchronization models for distributed algorithms. SIGMETRICS Perf. Eval. Rev. 13(2), 147\u2013154 (1985)","journal-title":"SIGMETRICS Perf. Eval. Rev."},{"key":"11_CR25","unstructured":"Schweitzer, P.: Aggregation methods for large Markov chains. In: Mathematical Computer Performance and Reliability (1984)"},{"issue":"8","key":"11_CR26","first-page":"531","volume":"32","author":"J Sproston","year":"2006","unstructured":"Sproston, J., Donatelli, S.: Backward bisimulation in markov chain model checking. IEEE TSE 32(8), 531\u2013546 (2006)","journal-title":"IEEE TSE"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/15326348908807099","volume":"5","author":"U Sumita","year":"1989","unstructured":"Sumita, U., Reiders, M.: Lumpability and time-reversibility in the aggregation-disaggregation method for large markov chains. Commun. Stat. Stoch. Models 5, 63\u201381 (1989)","journal-title":"Commun. Stat. Stoch. Models"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22264-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T19:54:12Z","timestamp":1674244452000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22264-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319222639","9783319222646"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22264-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"22 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}