Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
The paper reports on the formal framework to design strategies for multi-issue non-symmetric meaning negotiations among software agents in a distributed information retrieval syste...
The purpose of this paper is to report on experiments in (human) multi-issue negotiation and their analysis, and to present a generic software environment supporting such an analy...
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...