441 search results - page 1 / 89 » A Method for Proving Observational Equivalence |
CSFW
2009
IEEE
14 years 1 days ago
2009
IEEE
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
MSCS
2007
13 years 4 months ago
2007
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
ENTCS
2007
13 years 5 months ago
2007
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
ENTCS
2007
13 years 5 months ago
2007
We define an observational equivalence for Lafont’s interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting ...
PRICAI
2000
Springer
13 years 8 months ago
2000
Springer
This paper introduces the even-odd POMDP, an approximation to POMDPs in which the world is assumed to be fully observable every other time step. The even-odd POMDP can be converte...