19 search results - page 2 / 4 » Simulation and Bisimulation for Probabilistic Timed Automata |
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
QEST
2010
IEEE
13 years 2 months ago
2010
IEEE
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
IJFCS
2008
13 years 4 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...