37 search results - page 1 / 8 » Approximated Computationally Bounded Simulation Relations fo... |
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...
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...
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
ENTCS
2007
13 years 4 months ago
2007
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...