{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:56:35Z","timestamp":1743047795468,"version":"3.40.3"},"publisher-location":"London","reference-count":12,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781447145936"},{"type":"electronic","value":"9781447145943"}],"license":[{"start":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T00:00:00Z","timestamp":1351555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T00:00:00Z","timestamp":1351555200000},"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":[[2013]]},"DOI":"10.1007\/978-1-4471-4594-3_14","type":"book-chapter","created":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T20:28:42Z","timestamp":1351542522000},"page":"131-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cooperating Stochastic Automata: Approximate Lumping an Reversed Process"],"prefix":"10.1007","author":[{"given":"S.","family":"Balsamo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. Dei","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Marin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,30]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Balsamo, S., Dei Rossi, G., Marin, A.: Lumping and reversed processes in cooperating automata. In: Proceedings of International Conference on Analytical and Stochastic Modeling Techniques and Applications (ASMTA), Lecture Notes in Computer Science 7314, pp. 212\u2013226. Springer, Grenoble (2012)","DOI":"10.1007\/978-3-642-30782-9_15"},{"issue":"9","key":"14_CR2","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.: Product form approximations for communicating Markov processes. Perf. Eval. 67(9), 797\u2013815 (2010), Special Issue: QEST 2008","journal-title":"Perf. Eval."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Fourneau, J.M., Plateau, B., Stewart, W.J.: Product form for stochastic automata networks. In: Proceedings of ValueTools \u201907. pp. 1\u201310. ICST, Brussels (2007)","DOI":"10.4108\/valuetools.2007.1980"},{"issue":"5","key":"14_CR4","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.: An efficient algorithm for aggregating PEPA models. IEEE Trans. Softw. Eng. 27(5), 449\u2013464 (2001)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"14_CR5","unstructured":"Hillston, J.: A compositional approach to performance modelling. Ph.D. thesis, Department of Computer Science, University of Edinburgh (1994)"},{"key":"14_CR6","first-page":"296","volume":"37","author":"M.N. Jacobi","year":"2010","unstructured":"Jacobi, M.N.: A robust spectral method for finding lumpings and meta stable states of non-reversible Markov chains. Elect. Trans. Num. An. 37, 296\u2013306 (2010)","journal-title":"Elect. Trans. Num. An."},{"key":"14_CR7","unstructured":"Kelly, F.: Reversibility and Stochastic Networks. Wiley, New York (1979)"},{"key":"14_CR8","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains, Chap. II. D. Van Nostrand Company, inc. (1960)"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1109\/TPAMI.2006.184","volume":"28","author":"S. Lafon","year":"2006","unstructured":"Lafon, S., Lee, A.: Diffusion maps and coarse-graining: a unified framework for dimensionality reduction, graph partitioning, and data set parametrization. IEEE Trans. Pattern Anal. Mach. Intell. 28, 1393\u20131403 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Miner, A.S., Ciardo, G., Donatelli, S.: Using the exact state space of a markov model to compute approximate stationary measures. In: Proceedings of ACM SIGMETRIC, pp. 207\u2013216. ACM, New York (2000)","DOI":"10.1145\/345063.339417"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Stewart, W.J.: Probability, Markov Chains, Queues, and Simulation. Princeton University Press, Princeton (2009)","DOI":"10.1515\/9781400832811"},{"issue":"3","key":"14_CR12","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R. Xu","year":"2005","unstructured":"Xu, R., Wunsch, D.: Survey of clustering algorithms. IEEE Trans. Neural Netw. 16(3), 645\u2013678 (2005)","journal-title":"IEEE Trans. Neural Netw."}],"container-title":["Computer and Information Sciences III"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-4594-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T11:28:24Z","timestamp":1675942104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-4594-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,30]]},"ISBN":["9781447145936","9781447145943"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-4594-3_14","relation":{},"subject":[],"published":{"date-parts":[[2012,10,30]]},"assertion":[{"value":"30 October 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}