441 search results - page 44 / 89 » A Method for Proving Observational Equivalence |
136
click to vote
IFIP
2009
Springer
16 years 1 days 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...
155
click to vote
ENTCS
2007
15 years 5 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 ...
172
click to vote
CSFW
2005
IEEE
15 years 11 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...
142
click to vote
COLT
2004
Springer
15 years 11 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 ...
216
click to vote
FMSB
2008
15 years 7 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 ...