The following pages link to Decoding choice encodings (Q1854385):
Displaying 39 items.
- A randomized encoding of the \(\pi\)-calculus with mixed choice (Q555750) (← links)
- A taxonomy of process calculi for distribution and mobility (Q660996) (← links)
- Theory of interaction (Q896903) (← links)
- On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus (Q896922) (← links)
- Comparing communication primitives via their relative expressive power (Q1004386) (← links)
- On bisimulations for the asynchronous \(\pi\)-calculus (Q1276246) (← links)
- Types for access control (Q1575157) (← links)
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus (Q1641151) (← links)
- On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus (Q1763728) (← links)
- A calculus for reasoning about software composition (Q1770365) (← links)
- A hierarchy of equivalences for asynchronous calculi (Q1772314) (← links)
- What is a ``good'' encoding of guarded choice? (Q1854329) (← links)
- On the expressive power of movement and restriction in pure mobile ambients (Q1881256) (← links)
- Abstractions for fault-tolerant global computing (Q1881258) (← links)
- Distinguishing and relating higher-order and first-order processes by expressiveness (Q1935453) (← links)
- Towards a unified approach to encodability and separation results for process calculi (Q1959439) (← links)
- The \(C_\pi\)-calculus: a model for confidential name passing (Q1996859) (← links)
- On the interactive power of higher-order processes extended with parameterization (Q2026374) (← links)
- Coupled similarity: the first 32 years (Q2182667) (← links)
- Replacement freeness: a criterion for separating process calculi (Q2210864) (← links)
- Linear forwarders (Q2384926) (← links)
- Tutorial on separation results in process calculi via leader election problems (Q2464946) (← links)
- CCS with priority guards (Q2474050) (← links)
- On the expressive power of \textsc{Klaim}-based calculi (Q2491638) (← links)
- Communication and mobility control in boxed ambients (Q2573334) (← links)
- On an open problem of Amadio and Curien: The finite antichain condition (Q2573335) (← links)
- On the relative expressive power of calculi for mobility (Q2805161) (← links)
- On the expressive power of polyadic synchronisation in \(\pi \)-calculus (Q2842599) (← links)
- Expressiveness of process algebras (Q2870198) (← links)
- Breaking symmetries (Q2971075) (← links)
- The λ-calculus in the π-calculus (Q3094164) (← links)
- (Q3385647) (← links)
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi (Q3541040) (← links)
- (Q5013871) (← links)
- (Q5013872) (← links)
- (Q5141619) (← links)
- A Translation of Beta-binders in a Prioritized Pi-calculus (Q5404078) (← links)
- Full abstraction for expressiveness: history, myths and facts (Q5741573) (← links)
- Decoding choice encodings (Q6104373) (← links)
