3 search results - page 1 / 1 » An Unbounded Nondeterministic Model for CSP-like Languages |
IWFM
1998
13 years 6 months ago
1998
APAL
2008
13 years 5 months ago
2008
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...