71 search results - page 6 / 15 » Anonymity in Probabilistic and Nondeterministic Systems |
QEST
2010
IEEE
14 years 7 months ago
2010
IEEE
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
JASIS
2006
14 years 9 months ago
2006
P2P applications are rapidly gaining acceptance among users of Internet-based services, especially because of their capability of exchanging resources while preserving the anonymi...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
CONCUR
2000
Springer
15 years 1 months ago
2000
Springer
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...
CONCUR
2001
Springer
15 years 2 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...