10 search results - page 2 / 2 » Weak Bisimulation for Fully Probabilistic Processes |
TGC
2010
Springer
13 years 3 months ago
2010
Springer
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
ENTCS
2007
13 years 5 months ago
2007
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
ICALP
2011
Springer
12 years 9 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
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
CVPR
2010
IEEE
14 years 2 months ago
2010
IEEE
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...