Sciweavers

138 search results - page 6 / 28
» Unifying Probability with Nondeterminism
Sort
View
IANDC
2010
116views more  IANDC 2010»
13 years 6 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
ARTS
1999
Springer
13 years 12 months ago
Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms
In this paper we show how quantitative program logic [14] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and...
Annabelle McIver
JOLLI
2006
80views more  JOLLI 2006»
13 years 7 months ago
Means-End Relations and a Measure of Efficacy
Abstract. Propositional dynamic logic (PDL) provides a natural setting for semantics of means-end relations involving non-determinism, but such models do not include probabilistic ...
Jesse Hughes, Albert C. Esterline, Bahram Kimiagha...
DAGSTUHL
2001
13 years 9 months ago
JaVis: A UML-Based Visualization and Debugging Environment for Concurrent Java Programs
Debugging concurrent Java programs is a difficult task because of multiple control flows and inherent nondeterminism. It requires techniques not provided by traditional debuggers ...
Katharina Mehner
ICPR
2000
IEEE
14 years 1 days ago
A Unifying View of Image Similarity
We study solutions to the problem of evaluating image similarity in the context of content-based image retrieval (CBIR). Retrieval is formulated as a classification problem, wher...
Nuno Vasconcelos, Andrew Lippman