CONCUR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...