198 search results - page 10 / 40 » Weak Probabilistic Anonymity |
ALGOSENSORS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, a...
TCS
2008
13 years 9 months ago
2008
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively o...
QEST
2007
IEEE
14 years 3 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
PET
2005
Springer
14 years 2 months ago
2005
Springer
Parallel mixing [7] is a technique for optimizing the latency of a synchronous re-encryption mix network. We analyze the anonymity of this technique when an adversary can learn the...
FOSSACS
2007
Springer
14 years 3 months ago
2007
Springer
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...