Sciweavers

748 search results - page 28 / 150
» Time and Probability in Process Algebra
Sort
View
110
Voted
CONCUR
2001
Springer
15 years 4 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
COORDINATION
2004
Springer
15 years 5 months ago
Probabilistic and Prioritized Data Retrieval in the Linda Coordination Model
Linda tuple spaces are flat and unstructured, in the sense that they do not allow for expressing preferences of tuples; for example, we could be interested in indicating tuples th...
Mario Bravetti, Roberto Gorrieri, Roberto Lucchi, ...
LICS
2002
IEEE
15 years 5 months ago
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
We observe that equivalence is not a robust concept in the presence of numerical information - such as probabilities - in the model. We develop a metric analogue of weak bisimulat...
Josee Desharnais, Radha Jagadeesan, Vineet Gupta, ...
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
14 years 10 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen
ICCV
2001
IEEE
16 years 2 months ago
Stochastic Processes in Vision: From Langevin to Beltrami
Diffusion processes which are widely used in low level vision are presented as a result of an underlying stochastic process. The short-time non-linear diffusion is interpreted as ...
Nir A. Sochen