71 search results - page 10 / 15 » Anonymity in Probabilistic and Nondeterministic Systems |
ENTCS
2008
14 years 9 months ago
2008
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
103
click to vote
FORTE
2008
14 years 11 months ago
2008
Abstract. Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For th...
FMCO
2005
Springer
15 years 3 months ago
2005
Springer
babilistic Chemical Abstract Machine and the Expressiveness of Linda Languages Alessandra Di Pierro1 , Chris Hankin2 , and Herbert Wiklicky2 1 Dipartimento di Informatica, Universi...
FORMATS
2009
Springer
15 years 1 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
CCS
2009
ACM
15 years 1 months ago
2009
ACM
This work casts the traffic analysis of anonymity systems, and in particular mix networks, in the context of Bayesian inference. A generative probabilistic model of mix network ar...