Dayar, TuğrulPekergin, N.Younès, S.2016-02-082016-02-082006-10http://hdl.handle.net/11693/27135Date of Conference: 10 October, 2006Conference name: SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chainsThe problem of computing bounds on the conditional steady-state probability vector of a subset of states in finite, ergodic discrete-time Markov chains (DTMCs) is considered. An improved algorithm utilizing the strong stochastic (st-)order is given. On standard benchmarks from the literature and other examples, it is shown that the proposed algorithm performs better than the existing one in the strong stochastic sense. Furthermore, in certain cases the conditional steady-state probability vector of the subset under consideration can be obtained exactly. Copyright 2006 ACM.EnglishBoundingConditional steady-state vectorMarkov chainsStochastic comparisonStrong stochastic orderComputing boundsConditionla steady state probability vectorsDiscrete time markov chainsStochastic comparisonsAlgorithmsProbability distributionsStochastic control systemsVectorsMarkov processesConference Paper10.1145/1190366.1190368