441 search results - page 44 / 89 » A Method for Proving Observational Equivalence |
IFIP
2009
Springer
14 years 3 months ago
2009
Springer
We propose a process calculus for mobile ad hoc networks which embodies a behaviour-based multilevel decentralised trust model. Our trust model supports both direct trust, by monit...
ENTCS
2007
13 years 8 months ago
2007
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
CSFW
2005
IEEE
14 years 2 months ago
2005
IEEE
Authentication and secrecy properties are proved by very different methods: the former by local reasoning, leading to matching knowledge of all principals about the order of their...
COLT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We consider Reinforcement Learning for average reward zerosum stochastic games. We present and analyze two algorithms. The first is based on relative Q-learning and the ...
FMSB
2008
13 years 10 months ago
2008
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...