Establishes a separation theorem with no basic success-sensitive encoding of CCSK into CCS or pi-calculus, plus restricted encodings into internal pi-calculus under strong or weak bisimilarity.
Phillips (2008): CCS with priority guards
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
CCS extended with priorities and clocks yields coherence, a property that supports compositional encoding of synchronous determinate languages like Esterel.
citing papers explorer
-
On the Encodability of Reversible Process Calculi
Establishes a separation theorem with no basic success-sensitive encoding of CCSK into CCS or pi-calculus, plus restricted encodings into internal pi-calculus under strong or weak bisimilarity.
-
Determinacy with Priorities up to Clocks
CCS extended with priorities and clocks yields coherence, a property that supports compositional encoding of synchronous determinate languages like Esterel.