International audienceWhen dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to resolve the nondeterminism. It has been observed that for certain applications, notably those in security, the scheduler needs to be restricted so not to reveal the outcome of the protocol's random choices, or otherwise the model of adversary would be too strong even for ``obviously correct'' protocols. We propose a process-algebraic framework in which the control on the scheduler can be specified in syntactic terms, and we show how to apply it to solve the problem mentioned above. We also consider the definition of (probabilistic) may and must preorders,...
International audienceSymbolic protocol verification generally abstracts probabilities away, conside...
Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit b...
Extending Communicating Sequential Processes (CSP) by preserving the distributivity laws for interna...
International audienceWhen dealing with process calculi and automata which express both nondetermini...
AbstractWhen dealing with process calculi and automata which express both nondeterministic and proba...
When dealing with process calculi and automata which express both nondeterministic and probabilistic...
Abstract. When dealing with process calculi and automata which ex-press both nondeterministic and pr...
AbstractWhen modelling cryto-protocols by means of process calculi which express both nondeterminist...
Modeling frameworks such as Probabilistic I/O Automata (PIOA) andMarkov Decision Processes permit bo...
Abstract. When modelling security protocols by means of process cal-culi that express both nondeterm...
Contains fulltext : 27561.pdf (publisher's version ) (Open Access)This thesis is w...
Symbolic protocol verification generally abstracts probabilities away, considering computations that...
International audienceSymbolic protocol verification generally abstracts probabilities away, conside...
International audienceSymbolic protocol verification generally abstracts probabilities away, conside...
Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit b...
Extending Communicating Sequential Processes (CSP) by preserving the distributivity laws for interna...
International audienceWhen dealing with process calculi and automata which express both nondetermini...
AbstractWhen dealing with process calculi and automata which express both nondeterministic and proba...
When dealing with process calculi and automata which express both nondeterministic and probabilistic...
Abstract. When dealing with process calculi and automata which ex-press both nondeterministic and pr...
AbstractWhen modelling cryto-protocols by means of process calculi which express both nondeterminist...
Modeling frameworks such as Probabilistic I/O Automata (PIOA) andMarkov Decision Processes permit bo...
Abstract. When modelling security protocols by means of process cal-culi that express both nondeterm...
Contains fulltext : 27561.pdf (publisher's version ) (Open Access)This thesis is w...
Symbolic protocol verification generally abstracts probabilities away, considering computations that...
International audienceSymbolic protocol verification generally abstracts probabilities away, conside...
International audienceSymbolic protocol verification generally abstracts probabilities away, conside...
Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit b...
Extending Communicating Sequential Processes (CSP) by preserving the distributivity laws for interna...