Replacement freeness: A criterion for separating process calculi
We introduce a new criterion to discern the relative expressiveness of process calculi. Intuitively, a calculus is replacement free if replacing a sub-process that cannot perform any visible action by an arbitrary one never affects the capability of the resulting process to perform a visible action....
Saved in:
| Published in | Journal of logical and algebraic methods in programming Vol. 116; p. 100579 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
01.11.2020
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | We introduce a new criterion to discern the relative expressiveness of process calculi. Intuitively, a calculus is replacement free if replacing a sub-process that cannot perform any visible action by an arbitrary one never affects the capability of the resulting process to perform a visible action. By relying on two slightly different formulations of our criterion we partition the set of process calculi into three classes. Then, we prove that no suitable encodings between any two of such classes exist; hence calculi belonging to different classes have different relative expressiveness. Finally, we classify many well-known variants of the mainstream calculi CCS and the π-calculus, thus demonstrating their expressiveness gaps. |
|---|---|
| ISSN: | 2352-2208 |
| DOI: | 10.1016/j.jlamp.2020.100579 |