Sciweavers

198 search results - page 6 / 40
» Weak Probabilistic Anonymity
Sort
View
CONCUR
2000
Springer
14 years 1 months ago
Weak Bisimulation for Probabilistic Systems
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
Anna Philippou, Insup Lee, Oleg Sokolsky
LICS
2002
IEEE
14 years 2 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, ...
KR
2004
Springer
14 years 2 months ago
Weak Nonmonotonic Probabilistic Logics
Thomas Lukasiewicz
CAV
1997
Springer
97views Hardware» more  CAV 1997»
14 years 1 months ago
Weak Bisimulation for Fully Probabilistic Processes
Christel Baier, Holger Hermanns
CDC
2010
IEEE
107views Control Systems» more  CDC 2010»
13 years 4 months ago
Probabilistic mutual localization in multi-agent systems from anonymous position measures
Abstract-- Recent research on multi-agent systems has produced a plethora of decentralized controllers that implicitly assume various degrees of agent localization. However, many p...
Antonio Franchi, Giuseppe Oriolo, Paolo Stegagno