Probabilistic weak simulation is polynomially decidable


Baier, C. and Hermanns, H. and Katoen, J.P. (2004) Probabilistic weak simulation is polynomially decidable. Information Processing Letters, 89 (3). pp. 123-252. ISSN 0020-0190

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:This paper considers a weak simulation preorder for Markov chains that allows for stuttering. Despite the second-order quantification in its definition, we present a polynomial-time algorithm to compute the weak simulation preorder of a finite Markov chain.
Item Type:Article
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page