Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
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...
Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with -regular objectives; and (b) synthesizes reasonable environment assumptions f...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...