{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T13:13:50Z","timestamp":1713186830798},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"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":[[2000,9]]},"DOI":"10.1016\/s0166-5316(99)00081-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:09:16Z","timestamp":1027606156000},"page":"21-39","source":"Crossref","is-referenced-by-count":8,"title":["On the convergence of the power series algorithm"],"prefix":"10.1016","volume":"42","author":[{"given":"Gerard","family":"Hooghiemstra","sequence":"first","affiliation":[]},{"given":"Ger","family":"Koole","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0166-5316(99)00081-4_BIB1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01198401","article-title":"The M\/M\/c queue with critical jobs","volume":"47","author":"Adan","year":"1998","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-5316(99)00081-4_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-0427(93)90128-X","article-title":"An application of Gegenbauer polynomials in queueing theory","volume":"49","author":"Bavinck","year":"1993","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/S0166-5316(99)00081-4_BIB3","unstructured":"P. Billingsley, Convergence of Probability Measures, Wiley, New York, 1968."},{"key":"10.1016\/S0166-5316(99)00081-4_BIB4","doi-asserted-by":"crossref","unstructured":"J.P.C. Blanc, Performance analysis and optimization with the power-series algorithm, in: L. Donatiello, R. Nelson (Eds.), Performance Evaluation of Computers and Communication Systems, Springer, Berlin, 1993, pp. 53\u201380.","DOI":"10.1007\/BFb0013849"},{"key":"10.1016\/S0166-5316(99)00081-4_BIB5","unstructured":"J.P.C. Blanc, A numerical study of a coupled processor model, in: G. Iazeolla, P.J. Courtois, O.J. Boxma (Eds.), Computer Performance and Reliability, North-Holland, Amsterdam, 1998, pp. 289\u2013303."},{"key":"10.1016\/S0166-5316(99)00081-4_BIB6","unstructured":"W.-K. Chen, Applied Graph Theory, North-Holland, Amsterdam, 1971."},{"key":"10.1016\/S0166-5316(99)00081-4_BIB7","unstructured":"J.W. Cohen, The Single Server Queue, North-Holland, Amsterdam, 1982."},{"key":"10.1016\/S0166-5316(99)00081-4_BIB8","doi-asserted-by":"crossref","unstructured":"M.I. Freidlin, A.D. Wentzell, Random Peturbations of Dynamical Systems, Springer, New York, 1984.","DOI":"10.1007\/978-1-4684-0176-9"},{"key":"10.1016\/S0166-5316(99)00081-4_BIB9","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1137\/0148069","article-title":"Power series for stationary distributions of coupled processor models","volume":"48","author":"Hooghiemstra","year":"1988","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-5316(99)00081-4_BIB10","unstructured":"W.B. van den Hout, The power series algorithm, a numerical approach to Markov processes, Ph.D. Thesis, Tilburg University, 1996."},{"key":"10.1016\/S0166-5316(99)00081-4_BIB11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1080\/15326349808807467","article-title":"Bounds for performance characteristics: a systematic approach via cost structures","volume":"14","author":"van Houtum","year":"1998","journal-title":"Stochast. Models"},{"key":"10.1016\/S0166-5316(99)00081-4_BIB12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1287\/ijoc.9.1.51","article-title":"On the use of the power series algorithm for general Markov processes, with an application to a Petri net","volume":"9","author":"Koole","year":"1997","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0166-5316(99)00081-4_BIB13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0703007","article-title":"On the convergence and stability of the epsilon algorithm","volume":"3","author":"Wynn","year":"1996","journal-title":"SIAM J. Num. Anal."}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531699000814?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531699000814?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:26:23Z","timestamp":1556468783000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531699000814"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0166531699000814"],"URL":"https:\/\/doi.org\/10.1016\/s0166-5316(99)00081-4","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}