19 search results - page 2 / 4 » Simulation and Bisimulation for Probabilistic Timed Automata |
137
Voted
QEST
2008
IEEE
15 years 7 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...
90
Voted
QEST
2010
IEEE
14 years 11 months ago
2010
IEEE
142
Voted
ICALP
2011
Springer
14 years 4 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 ...
95
Voted
QEST
2008
IEEE
15 years 7 months ago
2008
IEEE
98
Voted
IJFCS
2008
15 years 1 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...