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.
Towards a unified approach to encodability and separation results for process calculi
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Reconfigurable async automata equal fixed ones in power via translations, but any equivalent fixed automaton must disseminate all communication knowledge to every process or render some irrelevant.
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.
-
Adding Reconfiguration to Zielonka's Asynchronous Automata
Reconfigurable async automata equal fixed ones in power via translations, but any equivalent fixed automaton must disseminate all communication knowledge to every process or render some irrelevant.