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

PDF
Restricted to UT campus only: Request a copy
231Kb

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
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Formal Methods and Tools (FMT)
Link to this item:	http://purl.utwente.nl/publications/63269
Official URL:	http://dx.doi.org/10.1016/j.ipl.2003.10.001
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page