{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:06:04Z","timestamp":1725491164983},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752103"},{"type":"electronic","value":"9783540752110"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75211-0_16","type":"book-chapter","created":{"date-parts":[[2007,9,7]],"date-time":"2007-09-07T22:39:20Z","timestamp":1189204760000},"page":"213-227","source":"Crossref","is-referenced-by-count":8,"title":["Censoring Markov Chains and Stochastic Bounds"],"prefix":"10.1007","author":[{"given":"J. -M.","family":"Fourneau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Pekergin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Youn\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Abu-Amsha, O., Vincent, J.M.: An algorithm to bound functionals of Markov chains with large state space. In: 4th INFORMS Conference on Telecommunications, Boca Raton, Florida (1998)","key":"16_CR1"},{"unstructured":"Benmammoun, M., Busic, A., Fourneau, J.M., Pekergin, N.: Increasing convex monotone Markov chains: theory, algorithms and applications. In: Markov Anniversary Meeting, pp. 189\u2013210. Boson Books (2006)","key":"16_CR2"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/11549970_8","volume-title":"EPEW, WS-FM 2005","author":"A. Busic","year":"2005","unstructured":"Busic, A., Fourneau, J.M.: Bounds for Point and Steady-State Availability: An Algorithmic Approach Based on Lumpability and Stochastic Ordering. In: Bravetti, M., Kloul, L., Zavattaro, G. (eds.) EPEW, WS-FM 2005. LNCS, vol.\u00a03670, pp. 94\u2013108. Springer, Heidelberg (2005)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/1634.1637","volume":"31","author":"P. Courtois","year":"1984","unstructured":"Courtois, P., Semal, P.: Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition. J. of ACM\u00a031, 804\u2013825 (1984)","journal-title":"J. of ACM"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1051\/ro:2003015","volume":"37","author":"T. Dayar","year":"2003","unstructured":"Dayar, T., Fourneau, J.M., Pekergin, N.: Transforming stochastic matrices for stochastic comparison with the st-order. RAIRO-RO\u00a037, 85\u201397 (2003)","journal-title":"RAIRO-RO"},{"doi-asserted-by":"crossref","unstructured":"Dayar, T., Pekergin, N., Younes, S.: Conditional Steady-State Bounds for a Subset of States in Markov Chains. In: SMCTools, Pisa, Italy (2006)","key":"16_CR6","DOI":"10.1145\/1190366.1190368"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.laa.2004.02.005","volume":"386","author":"J.M. Fourneau","year":"2004","unstructured":"Fourneau, J.M., Le Coz, M., Quessette, F.: Algorithms for an irreducible and lumpable strong stochastic bound. Linear Algebra and Applications\u00a0386, 167\u2013186 (2004)","journal-title":"Linear Algebra and Applications"},{"doi-asserted-by":"crossref","unstructured":"Fourneau, J.M., Le Coz, M., Pekergin, N., Quessette, F.: An open tool to compute stochastic bounds on steady-state distributions and rewards. In: IEEE Mascots 2003, Orlando, USA (2003)","key":"16_CR8","DOI":"10.1109\/MASCOT.2003.1240661"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-45798-4_4","volume-title":"Performance Evaluation of Complex Systems: Techniques and Tools","author":"J.M. Fourneau","year":"2002","unstructured":"Fourneau, J.M., Pekergin, N.: An algorithmic approach to stochastic bounds. In: Calzarossa, M.C., Tucci, S. (eds.) Performance 2002. LNCS, vol.\u00a02459, pp. 64\u201388. Springer, Heidelberg (2002)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1016\/j.ejor.2005.08.016","volume":"176","author":"S. Haddad","year":"2007","unstructured":"Haddad, S., Moreaux, P.: Sub-stochastic matrix analysis for bounds computation-Theoretical results. Eur. Jour. of Operational. Res.\u00a0176, 999\u20131015 (2007)","journal-title":"Eur. Jour. of Operational. Res."},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/1031050","volume":"31","author":"C.D. Meyer","year":"1989","unstructured":"Meyer, C.D.: Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems. SIAM Review\u00a031(2), 240\u2013272 (1989)","journal-title":"SIAM Review"},{"doi-asserted-by":"crossref","unstructured":"Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. SIAM (2000)","key":"16_CR12","DOI":"10.1137\/1.9780898719512"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1016\/j.ejor.2001.09.001","volume":"165","author":"N. Pekergin","year":"2005","unstructured":"Pekergin, N., Dayar, T., Alparslan, D.: Compenent-wise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering. Eur. Jour. of Op. Res.\u00a0165, 810\u2013825 (2005)","journal-title":"Eur. Jour. of Op. Res."},{"key":"16_CR14","volume-title":"Comparison Methods for Stochastic Models and Risks","author":"A. Muller","year":"2002","unstructured":"Muller, A., Stoyan, D.: Comparison Methods for Stochastic Models and Risks. Wiley, New York (2002)"},{"key":"16_CR15","volume-title":"Stochastic Orders and Their Applications","author":"M. Shaked","year":"1994","unstructured":"Shaked, M., Shantikumar, J.G.: Stochastic Orders and Their Applications. Academic Press, San Diago (1994)"},{"key":"16_CR16","volume-title":"Probability and Statistic with Reliability, Queueing and Computer Science Applications","author":"K.S. Trivedi","year":"2002","unstructured":"Trivedi, K.S.: Probability and Statistic with Reliability, Queueing and Computer Science Applications. Second Edition, Wiley (2002)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"830","DOI":"10.2307\/1428087","volume":"29","author":"L. Truffet","year":"1997","unstructured":"Truffet, L.: Near Complete Decomposability: Bounding the error by a Stochastic Comparison Method. App. Prob.\u00a029, 830\u2013855 (1997)","journal-title":"App. Prob."},{"doi-asserted-by":"crossref","unstructured":"Truffet, L.: Reduction Technique For Discrete Time Markov Chains on Totally Ordered State Space Using Stochastic Comparisons. Journal of Applied Probability\u00a037(3) (2000)","key":"16_CR18","DOI":"10.1017\/S0021900200016004"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"623","DOI":"10.2307\/3215344","volume":"33","author":"Y.Q. Zhao","year":"1996","unstructured":"Zhao, Y.Q., Liu, D.: The Censored Markov chain and the Best Augmentation. Jour. of App. Prob.\u00a033, 623\u2013629 (1996)","journal-title":"Jour. of App. Prob."}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Stochastic Models for Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75211-0_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:13Z","timestamp":1619506573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75211-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540752103","9783540752110"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75211-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}