{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T16:25:59Z","timestamp":1715963159164},"reference-count":38,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0166-5316(02)00227-4","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T02:21:32Z","timestamp":1052792492000},"page":"43-69","source":"Crossref","is-referenced-by-count":16,"title":["Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks"],"prefix":"10.1016","volume":"53","author":[{"given":"Oleg","family":"Gusak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tu\u011frul","family":"Dayar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Michel","family":"Fourneau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-5316(02)00227-4_BIB1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.2307\/3215235","article-title":"Exact and ordinary lumpability in finite Markov chains","volume":"31","author":"Buchholz","year":"1994","journal-title":"J. Appl. Probab."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0166-5316(93)E0040-C","article-title":"Hierarchical Markovian models: symmetries and reduction","volume":"22","author":"Buchholz","year":"1995","journal-title":"Perform. Eval."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB3","doi-asserted-by":"crossref","unstructured":"P. Buchholz, Equivalence relations for stochastic automata networks, in: W.J. Stewart (Ed.), Computations with Markov Chains, Kluwer Academic Publishers, Boston, MA, 1995, pp. 197\u2013215.","DOI":"10.1007\/978-1-4615-2241-6_13"},{"key":"10.1016\/S0166-5316(02)00227-4_BIB4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1017\/S0269964800004782","article-title":"An aggregation\/disaggregation algorithm for stochastic automata networks","volume":"11","author":"Buchholz","year":"1997","journal-title":"Probab. Eng. Inform. Sci."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB5","unstructured":"P. Buchholz, Projection methods for the analysis of stochastic automata networks, in: B. Plateau, W.J. Stewart, M. Silva (Eds.), Numerical Solution of Markov Chains, Prensas Universitarias de Zaragoza, Zaragoza, Spain, 1999, pp. 149\u2013168."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0304-3975(98)00169-8","article-title":"Exact performance equivalence: an equivalence relation for stochastic automata","volume":"215","author":"Buchholz","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB7","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/S0895479898342419","article-title":"Multilevel solutions for structured Markov chains","volume":"22","author":"Buchholz","year":"2000","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1287\/ijoc.12.3.203.12634","article-title":"Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models","volume":"12","author":"Buchholz","year":"2000","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s002110000173","article-title":"Circulant preconditioners for stochastic automata networks","volume":"87","author":"Chan","year":"2000","journal-title":"Numer. Math."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB10","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/TC.1981.6312174","article-title":"Kronecker products and shuffle algebra","volume":"C-30","author":"Davio","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB11","unstructured":"T. Dayar, Permuting Markov chains to nearly completely decomposable form, Technical Report BU-CEIS-9808, Department of Computer Engineering and Information Science, Bilkent University, Ankara, Turkey, August 1998. ftp:\/\/ftp.cs.bilkent.edu.tr\/pub\/tech-reports\/1998\/BU-CEIS-9808.ps.z."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB12","doi-asserted-by":"crossref","unstructured":"T. Dayar, O.I. Pentakalos, A.B. Stephens, Analytical modeling of robotic tape libraries using stochastic automata, Technical Report TR-97-189, CESDIS, NASA\/GSFC, Greenbelt, MD, January 1997.","DOI":"10.1109\/12.628395"},{"key":"10.1016\/S0166-5316(02)00227-4_BIB13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0917021","article-title":"On the effects of using the Grassmann\u2013Taksar\u2013Heyman method in iterative aggregation\u2013disaggregation","volume":"17","author":"Dayar","year":"1996","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB14","doi-asserted-by":"crossref","first-page":"1691","DOI":"10.1137\/S1064827598338159","article-title":"Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains","volume":"21","author":"Dayar","year":"2000","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB15","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/278298.278303","article-title":"Efficient descriptor\u2013vector multiplications in stochastic automata networks","volume":"45","author":"Fernandes","year":"1998","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0166-5316(02)00227-4_BIB16","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1051\/ro\/1998320303251","article-title":"Optimizing tensor product computations in stochastic automata networks","volume":"32","author":"Fernandes","year":"1998","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB17","unstructured":"J.-M. Fourneau, Stochastic automata networks: using structural properties to reduce the state space, in: B. Plateau, W.J. Stewart, M. Silva (Eds.), Numerical Solution of Markov Chains, Prensas Universitarias de Zaragoza, Zaragoza, Spain, 1999, pp. 332\u2013334."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB18","unstructured":"J.-M. Fourneau, H. Maisonniaux, N. Pekergin, V. V\u00e9que, Performance evaluation of a buffer policy with stochastic automata networks, in: Proceedings of the IFIP Workshop on Modelling and Performance Evaluation of ATM Technology, vol. C-15, La Martinique, IFIP Transactions, North-Holland, Amsterdam, 1993, pp. 433\u2013451."},{"issue":"5\u20136","key":"10.1016\/S0166-5316(02)00227-4_BIB19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02998495","article-title":"Modelling buffer admission mechanisms using stochastic automata networks","volume":"49","author":"Fourneau","year":"1994","journal-title":"Rev. Ann. T\u00e9l\u00e9commun."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB20","doi-asserted-by":"crossref","unstructured":"J.-M. Fourneau, F. Quessette, Graphs and stochastic automata networks, in: W.J. Stewart (Ed.), Computations with Markov Chains, Kluwer Academic Publishers, Boston, MA, 1995, pp. 217\u2013235.","DOI":"10.1007\/978-1-4615-2241-6_14"},{"key":"10.1016\/S0166-5316(02)00227-4_BIB21","unstructured":"O. Gusak, T. Dayar, J.-M. Fourneau, Stochastic automata networks and near complete decomposability, Technical Report BU-CE-0016, Department of Computer Engineering, Bilkent University, Ankara, Turkey, October 2000. http:\/\/www.cs.bilkent.edu.tr\/tech-reports\/2000\/BU-CE-0016.ps.z."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB22","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1137\/S089547980036975X","article-title":"Stochastic automata networks and near complete decomposability","volume":"23","author":"Gusak","year":"2001","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB23","doi-asserted-by":"crossref","unstructured":"J. Hillston, Compositional Markovian modelling using a process algebra, in: W.J. Stewart (Ed.), Computations with Markov Chains, Kluwer Academic Publishers, Boston, MA, 1995, pp. 177\u2013196.","DOI":"10.1007\/978-1-4615-2241-6_12"},{"key":"10.1016\/S0166-5316(02)00227-4_BIB24","unstructured":"J.R. Kemeny, J.L. Snell, Finite Markov Chains, Van Nostrand, New York, 1960."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB25","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/(SICI)1099-1506(199807\/08)5:4<253::AID-NLA124>3.0.CO;2-B","article-title":"Convergence analysis of an iterative aggregation\u2013disaggregation method for computing stationary probability vectors of stochastic matrices","volume":"5","author":"Marek","year":"1998","journal-title":"Numer. Linear Algebra Appl."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB26","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/1031050","article-title":"Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems","volume":"31","author":"Meyer","year":"1989","journal-title":"SIAM Rev."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB27","unstructured":"B. Plateau, De l\u2019\u00e9valuation du parall\u00e9lisme et de la synchronisation, Th\u00e8se d\u2019\u00e9tat, Universit\u00e9 Paris Sud Orsay, 1984."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB28","doi-asserted-by":"crossref","unstructured":"B. Plateau, On the stochastic structure of parallelism and synchronization models for distributed algorithms, in: Proceedings of the ACM SIGMETRICS Conference on Measurement and Modelling of Computer Systems, Austin, TX, 1985, pp. 147\u2013154.","DOI":"10.1145\/317795.317819"},{"key":"10.1016\/S0166-5316(02)00227-4_BIB29","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0166-5316(88)90031-4","article-title":"Performance analysis of synchronization for two communicating processes","volume":"8","author":"Plateau","year":"1988","journal-title":"Perform. Eval."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB30","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1109\/32.99196","article-title":"Stochastic automata network for modeling parallel systems","volume":"17","author":"Plateau","year":"1991","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB31","doi-asserted-by":"crossref","unstructured":"B. Plateau, J.-M. Fourneau, K.-H. Lee, PEPS: a package for solving complex Markov models of parallel systems, in: R. Puigjaner, D. Ptier (Eds.), Modeling Techniques and Tools for Computer Performance Evaluation, Palma de Majorca, Spain, 1988, pp. 291\u2013305.","DOI":"10.1007\/978-1-4613-0533-0_19"},{"key":"10.1016\/S0166-5316(02)00227-4_BIB32","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/0743-7315(91)90007-V","article-title":"A methodology for solving Markov models of parallel systems","volume":"12","author":"Plateau","year":"1991","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB33","unstructured":"M. Siegle, Structured Markovian performance modeling with automatic symmetry exploitation, in: Short Papers and Tool Descriptions of the 7th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, Vienna, Austria, 1994, pp. 77\u201381."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB34","doi-asserted-by":"crossref","unstructured":"G.W. Stewart, W.J. Stewart, D.F. McAllister, A two-stage iteration for solving nearly completely decomposable Markov chains, in: G.H. Golub, A. Greenbaum, M. Luskin (Eds.), Recent Advances in Iterative Methods, IMA Vol. Math. Appl. 60, Springer, New York, 1994, pp. 201\u2013216.","DOI":"10.1007\/978-1-4613-9353-5_12"},{"key":"10.1016\/S0166-5316(02)00227-4_BIB35","unstructured":"W.J. Stewart, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ, 1994."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB36","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0377-2217(94)00075-N","article-title":"The numerical solution of stochastic automata networks","volume":"86","author":"Stewart","year":"1995","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB37","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/S0377-2217(97)00215-4","article-title":"Iterative methods based on splittings for stochastic automata networks","volume":"110","author":"Uysal","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-5316(02)00227-4_BIB38","doi-asserted-by":"crossref","first-page":"2187","DOI":"10.1016\/S0169-7552(97)00122-0","article-title":"MRAP: a multiservices resource allocation policy for wireless ATM network","volume":"29","author":"V\u00e8que","year":"1998","journal-title":"Comput. Networks ISDN Syst."}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531602002274?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531602002274?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T21:34:34Z","timestamp":1682458474000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531602002274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0166531602002274"],"URL":"https:\/\/doi.org\/10.1016\/s0166-5316(02)00227-4","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}