{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T03:50:35Z","timestamp":1676778635569},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0377-2217(02)00431-9","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"436-451","source":"Crossref","is-referenced-by-count":15,"title":["Lumpable continuous-time stochastic automata networks"],"prefix":"10.1016","volume":"148","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\/S0377-2217(02)00431-9_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":"Journal of Applied Probability"},{"key":"10.1016\/S0377-2217(02)00431-9_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":"Performance Evaluation"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB3","series-title":"Computations with Markov Chains","first-page":"197","article-title":"Equivalence relations for stochastic automata networks","author":"Buchholz","year":"1995"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1017\/S0269964800004782","article-title":"An aggregation\u29f9disaggregation algorithm for stochastic automata networks","volume":"11","author":"Buchholz","year":"1997","journal-title":"Probability in the Engineering and Informational Sciences"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB5","unstructured":"P. Buchholz, Projection methods for the analysis of stochastic automata networks, in: B. Plateau, W.J. Stewart, M. Silva, (Eds.), Proceedings of the 3rd International Workshop on the Numerical Solution of Markov Chains, Prensas Universitarias de Zaragoza, Spain, 1999, pp. 149\u2013168"},{"key":"10.1016\/S0377-2217(02)00431-9_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":"Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB7","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 Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB8","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 Journal on Matrix Analysis and Applications"},{"key":"10.1016\/S0377-2217(02)00431-9_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":"Numerische Mathematik"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB10","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB11","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 Transactions on Computers"},{"key":"10.1016\/S0377-2217(02)00431-9_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, Maryland, January 1997","DOI":"10.1109\/12.628395"},{"key":"10.1016\/S0377-2217(02)00431-9_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 Journal on Scientific Computing"},{"key":"10.1016\/S0377-2217(02)00431-9_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 Journal on Scientific Computing"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-5316(93)90025-P","article-title":"Superposed stochastic automata: A class of stochastic Petri nets with parallel solution and distributed state space","volume":"18","author":"Donatelli","year":"1993","journal-title":"Performance Evaluation"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB16","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/278298.278303","article-title":"Efficient descriptor-vector multiplications in stochastic automata networks","volume":"45","author":"Fernandes","year":"1998","journal-title":"Journal of the ACM"},{"issue":"3","key":"10.1016\/S0377-2217(02)00431-9_BIB17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1051\/ro\/1998320303251","article-title":"Optimizing tensor product computations in stochastic automata networks, RAIRO","volume":"32","author":"Fernandes","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB18","doi-asserted-by":"crossref","unstructured":"P. Fernandes, R.J. Hessel, B. Plateau, W.J. Stewart, PEPS-2000 user manual, June 2000; available online at http:\/\/www-apache.imag.fr\/software\/peps\/PEPSman2000.ps.gz","DOI":"10.1109\/AERO.2000.878455"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB19","series-title":"Computations with Markov Chains","first-page":"217","article-title":"Graphs and stochastic automata networks","author":"Fourneau","year":"1995"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB20","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; available online at ftp:\/\/ftp.cs.bilkent.edu.tr\/pub\/tech-reports\/2000\/BU-CE-0016.ps.z"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB21","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 Journal on Matrix Analysis and Applications"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB22","unstructured":"O. Gusak, T. Dayar, J.-M. Fourneau, Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks, Performance Evaluation (submitted for publication)"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB23","series-title":"Finite Markov Chains","author":"Kemeny","year":"1960"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB24","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, Texas, 1985, pp. 147\u2013154","DOI":"10.1145\/317795.317819"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB25","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 Transactions on Software Engineering"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB26","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, Spain, 1988, pp. 291\u2013305","DOI":"10.1007\/978-1-4613-0533-0_19"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB27","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":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB28","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\/S0377-2217(02)00431-9_BIB29","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-Verlag, New York, 1994, pp. 201\u2013216","DOI":"10.1007\/978-1-4613-9353-5_12"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB30","series-title":"Introduction to the Numerical Solution of Markov Chains","author":"Stewart","year":"1994"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB31","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":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00431-9_BIB32","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":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004319?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004319?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T05:11:43Z","timestamp":1583989903000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702004319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0377221702004319"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00431-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}