86 search results - page 7 / 18 » Equivalence of Labeled Markov Chains |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—In this work, we study the effects of finite buffers on the throughput and delay of line networks with erasure links. We identify the calculation of performance parameters such...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
TGC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present a tool developed for fostering probabilistic model checking of services formally specified in Scows, a stochastic enrichment of the Calculus for Orchestration ...
CIVR
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we propose a novel Markov model-based formulation for the image annotation problem. In this formulation, we treat image annotation as a graph ranking problem, by de...
PACT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We use an enhanced operational semantics to infer quantitative measures on systems describing cryptographic protocols. System transitions carry enhanced labels. We assign...