{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:45:30Z","timestamp":1710251130056},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T00:00:00Z","timestamp":1408665600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10479-014-1694-3","type":"journal-article","created":{"date-parts":[[2014,8,21]],"date-time":"2014-08-21T16:36:35Z","timestamp":1408638995000},"page":"695-722","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lumping and reversed processes in cooperating automata"],"prefix":"10.1007","volume":"239","author":[{"given":"Simonetta","family":"Balsamo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gian-Luca","family":"Dei Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,22]]},"reference":[{"key":"1694_CR1","doi-asserted-by":"crossref","unstructured":"Valmari, A., & Franceschinis, F. (2010). Simple O (m logn) time markov chain lumping. In Proceedings of the International Conference TACAS, Paphos, Cyprus, pp 38\u201352.","DOI":"10.1007\/978-3-642-12002-2_4"},{"issue":"1","key":"1694_CR2","doi-asserted-by":"crossref","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. (2011). Lumping partially symmetrical stochastic models. Performance Evaluation, 68(1), 21\u201344.","journal-title":"Performance Evaluation"},{"issue":"7","key":"1694_CR3","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1109\/TSE.2003.1205180","volume":"29","author":"C Baier","year":"2003","unstructured":"Baier, C., Haverkort, B., Hermanns, H., & Katoen, J. (2003). Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering, 29(7), 524\u2013541.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"2","key":"1694_CR4","doi-asserted-by":"crossref","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., & Wolf, V. (2005). Comparative branching-time semantics for Markov chains. Information and Computer, 200(2), 149\u2013214.","journal-title":"Information and Computer"},{"key":"1694_CR5","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/TSE.1982.235424","volume":"SE\u20138","author":"S Balsamo","year":"1982","unstructured":"Balsamo, S., & Iazeolla, G. (1982). An extension of Norton\u2019s theorem for queueing networks. IEEE Trans on Software Engineers, SE\u20138, 298\u2013305.","journal-title":"IEEE Trans on Software Engineers"},{"key":"1694_CR6","doi-asserted-by":"crossref","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. (2007). Queueing networks. In M. Bernardo & J. Hillston (Eds.), Formal methods for performance evaluation (pp. 34\u201382). Heidelberg: LNCS, Springer."},{"key":"1694_CR7","doi-asserted-by":"crossref","unstructured":"Balsamo, S., & Marin, A. (2011) Performance engineering with product-form models: Efficient solutions and applications. In In proceedings of ICPE 2011, ACM, Karlsruhe, Germany (pp. 437\u2013448).","DOI":"10.1145\/1958746.1958812"},{"issue":"2","key":"1694_CR8","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.ejor.2013.03.011","volume":"229","author":"S Balsamo","year":"2013","unstructured":"Balsamo, S., & Marin, A. (2013). Separable solutions for Markov processes in random environments. European Journal of Operational Research, 229(2), 391\u2013403.","journal-title":"European Journal of Operational Research"},{"key":"1694_CR9","doi-asserted-by":"crossref","unstructured":"Balsamo, S., Dei Rossi, G., & Marin, A. (2012a). Cooperating stochastic automata: Approximate lumping an reversed process. In Proceedings of 27th International Symposium on Computer and Information Sciences, ISCIS, Paris, FR, pp. 131\u2013141.","DOI":"10.1007\/978-1-4471-4594-3_14"},{"key":"1694_CR10","doi-asserted-by":"crossref","unstructured":"Balsamo, S., Dei Rossi, G., & Marin, A. (2012b). Lumping and reversed processes in cooperating automata. In K. Al-Begain, D. Fiems, & J.M. Vincent (eds) Analytical and stochastic modeling techniques and applications, Springer, Berlin \/ Heidelberg, Lecture Notes in Computer Science, vol 7314, pp. 212\u2013226.","DOI":"10.1007\/978-3-642-30782-9_15"},{"issue":"7","key":"1694_CR11","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1016\/j.jss.2011.11.1042","volume":"85","author":"S Balsamo","year":"2012","unstructured":"Balsamo, S., Harrison, P. G., & Marin, A. (2012c). Methodological construction of product-form stochastic Petri-nets for performance evaluation. Journal of System and Software, 85(7), 1520\u20131539.","journal-title":"Journal of System and Software"},{"key":"1694_CR12","unstructured":"Balsamo, S., Dei Rossi, G., & Marin, A. (2013). Queueing networks and conditional product-forms. In Proceedings of Valuetools 2013, Turin, Italy, pp. 1\u201310."},{"issue":"2","key":"1694_CR13","doi-asserted-by":"crossref","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. (1975). Open, closed, and mixed networks of queues with different classes of customers. Journal of the ACM, 22(2), 248\u2013260.","journal-title":"Journal of the ACM"},{"issue":"5","key":"1694_CR14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S1571-0661(04)80520-6","volume":"68","author":"M Bravetti","year":"2003","unstructured":"Bravetti, M. (2003). Revisiting interactive Markov chains. Electronic Notes in Theoretical Computer Science, 68(5), 65\u201384.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"1694_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.peva.2003.07.001","volume":"56","author":"P Buchholz","year":"2004","unstructured":"Buchholz, P. (2004). Adaptive decomposition and approximation for the analysis of stochastic Petri nets. Performance Evaluation, 56, 23\u201352.","journal-title":"Performance Evaluation"},{"key":"1694_CR16","doi-asserted-by":"crossref","unstructured":"Buchholz, P. (2006). Bounding stationary results of tandem networks with MAP input and MAP service time distributions. In Proceedings of ACM SIGMETRICS\/PERFORMANCE, Saint Malo, FR, pp. 191\u2013202.","DOI":"10.1145\/1140103.1140300"},{"issue":"9","key":"1694_CR17","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.peva.2009.12.005","volume":"67","author":"P Buchholz","year":"2010","unstructured":"Buchholz, P. (2010). Product form approximations for communicating Markov processes. Performance Evaluation, 67(9), 797\u2013815., special Issue: QEST 2008.","journal-title":"Performance Evaluation"},{"issue":"6","key":"1694_CR18","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.4.6.699","volume":"4","author":"PJ Burke","year":"1956","unstructured":"Burke, P. J. (1956). The output of a queueing system. Operations Research, 4(6), 699\u2013704.","journal-title":"Operations Research"},{"issue":"1","key":"1694_CR19","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1147\/rd.191.0036","volume":"1","author":"KM Chandy","year":"1975","unstructured":"Chandy, K. M., Herzog, U., & Woo, L. (1975). Parametric analysis of queueing networks. IBM Journal of Research and Development, 1(1), 36\u201342.","journal-title":"IBM Journal of Research and Development"},{"issue":"11","key":"1694_CR20","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1109\/12.247838","volume":"42","author":"G Chiola","year":"1993","unstructured":"Chiola, G., Dutheillet, C., Franceschinis, G., & Haddad, S. (1993). Stochastic well-formed colored nets and symmetric modeling applications. IEEE Transactions on Computers, 42(11), 1343\u20131360.","journal-title":"IEEE Transactions on Computers"},{"key":"1694_CR21","volume-title":"Decomposability","author":"P Courtois","year":"1977","unstructured":"Courtois, P. (1977). Decomposability. New York: Academic Press."},{"issue":"4","key":"1694_CR22","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/1634.1637","volume":"31","author":"PJ Courtois","year":"1984","unstructured":"Courtois, P. J., & Semal, P. (1984). Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition. Journal of the ACM, 31(4), 804\u2013825.","journal-title":"Journal of the ACM"},{"key":"1694_CR23","doi-asserted-by":"crossref","unstructured":"Derisavi, S. (2007). A symbolic algorithm for optimal Markov chain lumping. In Proceedings of TACAS 2007, LNCS 4424, Springer, pp. 139\u2013154.","DOI":"10.1007\/978-3-540-71209-1_13"},{"issue":"6","key":"1694_CR24","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0020-0190(03)00343-0","volume":"87","author":"S Derisavi","year":"2003","unstructured":"Derisavi, S., Hermanns, H., & Sanders, W. H. (2003). Optimal state-space lumping in Markov chains. Elsevier Information Processing Letters, 87(6), 309\u2013315.","journal-title":"Elsevier Information Processing Letters"},{"key":"1694_CR25","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.laa.2004.01.006","volume":"386","author":"S Derisavi","year":"2004","unstructured":"Derisavi, S., Kemper, P., & Sanders, W. (2004). Symbolic state-space exploration and numerical analysis of state-sharing composed models. Linear Algebra and its Applications, 386, 137\u2013166.","journal-title":"Linear Algebra and its Applications"},{"key":"1694_CR26","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1239\/aap\/1113402405","volume":"37","author":"A Economou","year":"2005","unstructured":"Economou, A. (2005). Generalized product-form stationary distributions for Markov chains in random environment with queueing application. Advances in Applied Probability, 37, 185\u2013211.","journal-title":"Advances in Applied Probability"},{"key":"1694_CR27","doi-asserted-by":"crossref","unstructured":"Fourneau, J.M., Plateau, B., & Stewart, W.J. (2007). Product form for stochastic automata networks. In Proceedings of Value Tools 2007 Conference, ICST, ICST, Brussels, Belgium, pp. 1\u201310.","DOI":"10.4108\/valuetools.2007.1980"},{"issue":"1\u20133","key":"1694_CR28","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-5316(94)90015-9","volume":"20","author":"G Franceschinis","year":"1994","unstructured":"Franceschinis, G., & Muntz, R. R. (1994). Bounds for quasi-lumpable Markov chains. Performance Evaluation, 20(1\u20133), 223\u2013243.","journal-title":"Performance Evaluation"},{"issue":"3","key":"1694_CR29","doi-asserted-by":"crossref","first-page":"656","DOI":"10.2307\/3214499","volume":"28","author":"E Gelenbe","year":"1991","unstructured":"Gelenbe, E. (1991). Product form networks with negative and positive customers. Journal of Applied Probability, 28(3), 656\u2013663.","journal-title":"Journal of Applied Probability"},{"issue":"5","key":"1694_CR30","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1109\/32.922715","volume":"27","author":"S Gilmore","year":"2001","unstructured":"Gilmore, S., Hillston, J., & Ribaudo, M. (2001). An efficient algorithm for aggregating PEPA models. IEEE Trans on Software Engineers, 27(5), 449\u2013464.","journal-title":"IEEE Trans on Software Engineers"},{"issue":"7","key":"1694_CR31","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1093\/comjnl\/38.7.510","volume":"38","author":"P Harrison","year":"1995","unstructured":"Harrison, P., & Hillston, J. (1995). Exploiting quasi-reversible structures in Markovian process algebra models. The Computer Journal, 38(7), 510\u2013520.","journal-title":"The Computer Journal"},{"issue":"3","key":"1694_CR32","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1016\/S0304-3975(02)00375-4","volume":"290","author":"PG Harrison","year":"2003","unstructured":"Harrison, P. G. (2003). Turning back time in Markovian process algebra. Theoretical Computer Science, 290(3), 1947\u20131986.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20134","key":"1694_CR33","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0166-5316(02)00091-3","volume":"51","author":"A Heindl","year":"2003","unstructured":"Heindl, A. (2003). Decomposition of general queueing networks with MMPP inputs and customer losses. Performance Evaluation, 51(1\u20134), 117\u2013136.","journal-title":"Performance Evaluation"},{"key":"1694_CR34","doi-asserted-by":"crossref","unstructured":"Hermanns, H. (2002). Interactive Markov chains: The quest for quantified quality. LNCS 2428, Springer.","DOI":"10.1007\/3-540-45804-2"},{"key":"1694_CR35","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511569951","volume-title":"A compositional approach to performance modelling","author":"J Hillston","year":"1996","unstructured":"Hillston, J. (1996). A compositional approach to performance modelling. Cambridge: Cambridge Press."},{"key":"1694_CR36","unstructured":"Hillston, J., & Thomas, N. (1998). A syntactical analysis of reversible PEPA models. In Proceedings 6th Process Algebra and Performance Modelling Workshop, Nice, FR, pp. 37\u201349."},{"key":"1694_CR37","unstructured":"Hillston, J., Marin, A., Piazza, C. & Rossi, S. (2013). Contextual lumpability. In Proceedings of Valuetools 2013, Turin, Italy, pp. 1\u201310."},{"key":"1694_CR38","volume-title":"Reversibility and stochastic networks","author":"F Kelly","year":"1979","unstructured":"Kelly, F. (1979). Reversibility and stochastic networks. New York: Wiley."},{"key":"1694_CR39","unstructured":"Kemeny, J.G., & Snell, J.L. (1960). Finite Markov chains, D. Van Nostrand Company, inc., chap II."},{"key":"1694_CR40","volume-title":"Computer performance modeling handbook","author":"SS Lavenberg","year":"1983","unstructured":"Lavenberg, S. S. (1983). Computer performance modeling handbook. New York: Academic Press."},{"issue":"7","key":"1694_CR41","first-page":"1520","volume":"85","author":"A Marin","year":"2012","unstructured":"Marin, A., Balsamo, S., & Harrison, P. (2012). Analysis of stochastic Petri nets with signals. Performance Evaluation, 85(7), 1520\u20131539.","journal-title":"Performance Evaluation"},{"issue":"9","key":"1694_CR42","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/TC.1982.1676110","volume":"31","author":"MK Molloy","year":"1982","unstructured":"Molloy, M. K. (1982). Performance analysis using stochastic Petri nets. IEEE Transactions on Computers, 31(9), 913\u2013917.","journal-title":"IEEE Transactions on Computers"},{"key":"1694_CR43","unstructured":"Muntz, R. R. (1972). Poisson departure processes and queueing networks. Technique Report IBM Research Report RC4145, Yorktown Heights, New York."},{"key":"1694_CR44","volume-title":"Matrix geometric solutions in stochastic models","author":"MF Neuts","year":"1981","unstructured":"Neuts, M. F. (1981). Matrix geometric solutions in stochastic models. Baltimore, MD: John Hopkins."},{"issue":"2","key":"1694_CR45","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/317786.317819","volume":"13","author":"B Plateau","year":"1985","unstructured":"Plateau, B. (1985). On the stochastic structure of parallelism and synchronization models for distributed algorithms. SIGMETRICS Performance Evaluation Review, 13(2), 147\u2013154.","journal-title":"SIGMETRICS Performance Evaluation Review"},{"issue":"2","key":"1694_CR46","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/322374.322377","volume":"30","author":"G Stewart","year":"1983","unstructured":"Stewart, G. (1983). Computable error bounds for aggregated Markov chains. Journal of the ACM, 30(2), 271\u2013285.","journal-title":"Journal of the ACM"},{"key":"1694_CR47","volume-title":"Introduction to the numerical solution of Markov chains","author":"WJ Stewart","year":"1994","unstructured":"Stewart, W. J. (1994). Introduction to the numerical solution of Markov chains. UK: Princeton University Press."},{"key":"1694_CR48","unstructured":"Thomas, N., & Gilmore, S. (1998). Applying quasi-separability to Markovian process algebra. In Proceedings of the Sixth International Work on Process Algebra for Performance Modelling. Nice, France, pp. 27\u201336."},{"key":"1694_CR49","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/978-3-642-79917-4_17","volume-title":"Quantitative methods in parallel systems, esprit basic research series","author":"N Thomas","year":"1995","unstructured":"Thomas, N., & Mitrani, I. (1995). Routing among different nodes where servers break down without losing jobs. In F. Baccelli, A. Jean-Marie, & I. Mitrani (Eds.), Quantitative methods in parallel systems, esprit basic research series (pp. 248\u2013261). Berlin Heidelberg: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1694-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1694-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1694-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T05:14:43Z","timestamp":1565759683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1694-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,22]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["1694"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1694-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,22]]}}}