159 search results - page 8 / 32 » Weak Equivalences in Psi-Calculi |
132
click to vote
APAL
2004
15 years 6 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
132
click to vote
CONCUR
2005
Springer
15 years 11 months ago
2005
Springer
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
139
click to vote
ICICS
2004
Springer
15 years 11 months ago
2004
Springer
In 2002, Murphy and Robshaw introduced an extension BES of AES and argued this could compromise the security of AES. We introduce here two block-ciphers CES and Big-BES that are so...
151
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
We observe that equivalence is not a robust concept in the presence of numerical information - such as probabilities - in the model. We develop a metric analogue of weak bisimulat...
144
click to vote
BSL
2005
15 years 6 months ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...