The following pages link to Decoding choice encodings (Q6104373):
Displaying 11 items.
- Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous (Q516036) (← links)
- Theory of interaction (Q896903) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- On the expressiveness of internal mobility in name-passing calculi (Q1276243) (← links)
- Asynchronous process calculi: The first- and higher-order paradigms (Q1589656) (← links)
- What is a ``good'' encoding of guarded choice? (Q1854329) (← links)
- Decoding choice encodings (Q1854385) (← links)
- A thesis for interaction (Q2055962) (← links)
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators (Q5958469) (← links)
- On implementations and semantics of a concurrent programming language (Q6044131) (← links)
- On bisimulations for the asynchronous π-calculus (Q6104371) (← links)