{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:31:42Z","timestamp":1725514302534},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642307812"},{"type":"electronic","value":"9783642307829"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30782-9_15","type":"book-chapter","created":{"date-parts":[[2012,5,31]],"date-time":"2012-05-31T04:45:29Z","timestamp":1338439529000},"page":"212-226","source":"Crossref","is-referenced-by-count":3,"title":["Lumping and Reversed Processes in Cooperating Automata"],"prefix":"10.1007","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","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1109\/TSE.1982.235424","volume":"SE-8","author":"S. Balsamo","year":"1982","unstructured":"Balsamo, S., Iazeolla, G.: An extension of Norton\u2019s theorem for queueing networks. IEEE Trans. on Software Eng.\u00a0SE-8, 298\u2013305 (1982)","journal-title":"IEEE Trans. on Software Eng."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.peva.2003.07.001","volume":"56","author":"P. Buchholz","year":"2004","unstructured":"Buchholz, P.: Adaptive decomposition and approximation for the analysis of stochastic Petri nets. Perf. Eval.\u00a056, 23\u201352 (2004)","journal-title":"Perf. Eval."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Buchholz, P.: Bounding stationary results of tandem networks with MAP input and MAP service time distributions. In: Proc. of ACM SIGMETRICS\/PERFORMANCE, Saint Malo, FR, pp. 191\u2013202 (2006)","DOI":"10.1145\/1140103.1140300"},{"issue":"9","key":"15_CR4","doi-asserted-by":"publisher","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.\u00a067(9), 797\u2013815 (2010), special Issue: QEST 2008","journal-title":"Perf. Eval."},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1147\/rd.191.0036","volume":"1","author":"K.M. Chandy","year":"1975","unstructured":"Chandy, K.M., Herzog, U., Woo, L.: Parametric analysis of queueing networks. IBM Journal of Res. and Dev.\u00a01(1), 36\u201342 (1975)","journal-title":"IBM Journal of Res. and Dev."},{"issue":"4","key":"15_CR6","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/1634.1637","volume":"31","author":"P.J. Courtois","year":"1984","unstructured":"Courtois, P.J., Semal, P.: Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition. J. of the ACM\u00a031(4), 804\u2013825 (1984)","journal-title":"J. of the ACM"},{"key":"15_CR7","volume-title":"Decomposability","author":"P. Courtois","year":"1977","unstructured":"Courtois, P.: Decomposability. Academic Press, New York (1977)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1239\/aap\/1113402405","volume":"37","author":"A. Economou","year":"2005","unstructured":"Economou, A.: Generalized product-form stationary distributions for Markov chains in random environment with queueing application. Adv. in Appl. Prob.\u00a037, 185\u2013211 (2005)","journal-title":"Adv. in Appl. Prob."},{"key":"15_CR9","first-page":"1","volume-title":"ValueTools 2007: Proc. of the 2nd International Conference on Performance Evaluation Methodologies and Tools","author":"J.M. Fourneau","year":"2007","unstructured":"Fourneau, J.M., Plateau, B., Stewart, W.J.: Product form for stochastic automata networks. In: ValueTools 2007: Proc. of the 2nd International Conference on Performance Evaluation Methodologies and Tools, pp. 1\u201310. ICST, Brussels (2007)"},{"issue":"1-3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-5316(94)90015-9","volume":"20","author":"G. Franceschinis","year":"1994","unstructured":"Franceschinis, G., Muntz, R.R.: Bounds for quasi-lumpable markov chains. Elsevier Perf. Eval.\u00a020(1-3), 223\u2013243 (1994)","journal-title":"Elsevier Perf. Eval."},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"656","DOI":"10.2307\/3214499","volume":"28","author":"E. Gelenbe","year":"1991","unstructured":"Gelenbe, E.: Product form networks with negative and positive customers. J. of Appl. Prob.\u00a028(3), 656\u2013663 (1991)","journal-title":"J. of Appl. Prob."},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-58021-2_20","volume-title":"Computer Performance Evaluation","author":"S. Gilmore","year":"1994","unstructured":"Gilmore, S., Hillston, J.: The PEPA Workbench: A Tool to Support a Process Algebra Based Approach to Performance Modelling. In: Haring, G., Kotsis, G. (eds.) TOOLS 1994. LNCS, vol.\u00a0794, pp. 353\u2013368. Springer, Heidelberg (1994)"},{"issue":"5","key":"15_CR13","doi-asserted-by":"publisher","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. on Software Eng.\u00a027(5), 449\u2013464 (2001)","journal-title":"IEEE Trans. on Software Eng."},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/S0304-3975(02)00375-4","volume":"290","author":"P.G. Harrison","year":"2003","unstructured":"Harrison, P.G.: Turning back time in Markovian process algebra. Theoretical Computer Science\u00a0290(3), 1947\u20131986 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1-4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0166-5316(02)00091-3","volume":"51","author":"A. Heindl","year":"2003","unstructured":"Heindl, A.: Decomposition of general queueing networks with mmpp inputs and customer losses. Perf. Eval.\u00a051(1-4), 117\u2013136 (2003)","journal-title":"Perf. Eval."},{"key":"15_CR16","unstructured":"Hillston, J.: A Compositional Approach to Performance Modelling. Ph.D. thesis, Department of Computer Science, University of Edinburgh (1994)"},{"key":"15_CR17","volume-title":"Reversibility and stochastic networks","author":"F. Kelly","year":"1979","unstructured":"Kelly, F.: Reversibility and stochastic networks. Wiley, New York (1979)"},{"key":"15_CR18","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains, ch.\u00a0II. D. Van Nostrand Company, Inc. (1960)"},{"key":"15_CR19","volume-title":"Computer Performance Modeling Handbook","author":"S.S. Lavenberg","year":"1983","unstructured":"Lavenberg, S.S.: Computer Performance Modeling Handbook. Academic Press, New York (1983)"},{"issue":"9","key":"15_CR20","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1109\/TC.1982.1676110","volume":"31","author":"M.K. Molloy","year":"1982","unstructured":"Molloy, M.K.: Performance analysis using stochastic petri nets. IEEE Trans. on Comput.\u00a031(9), 913\u2013917 (1982)","journal-title":"IEEE Trans. on Comput."},{"issue":"2","key":"15_CR21","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 Perform. Eval. Rev.\u00a013(2), 147\u2013154 (1985)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"issue":"2","key":"15_CR22","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1145\/322374.322377","volume":"30","author":"G. Stewart","year":"1983","unstructured":"Stewart, G.: Computable error bounds for aggregated Markov chains. J. of the ACM\u00a030(2), 271\u2013285 (1983)","journal-title":"J. of the ACM"},{"key":"15_CR23","volume-title":"Introduction to the Numerical Solution of Markov Chains","author":"W.J. Stewart","year":"1994","unstructured":"Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, UK (1994)"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-12002-2_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Valmari","year":"2010","unstructured":"Valmari, A., Franceschinis, G.: Simple O(m logn) Time Markov Chain Lumping. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 38\u201352. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Analytical and Stochastic Modeling Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30782-9_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:30:30Z","timestamp":1620127830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30782-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307812","9783642307829"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30782-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}