Paper appeared
in the 19th International Conference on Concurrency Theory
(CONCUR'08),
Toronto (Canada), August 19th-22nd, 2008.
Full paper to appear in
Information and Computation.
In this paper, we present a unified approach to evaluating the relative expressive power of process calculi. In particular, we identify a small set of criteria (that have already been somehow presented in the literature) that an encoding should satisfy to be considered a good means for language comparison. We argue that the combination of such criteria is a valid proposal by noting that: (i) the best known encodings appeared in the literature satisfy them; (ii) this notion is not trivial, because there exist encodings that do not satisfy all the criteria we have proposed; (iii) the best known separation results can be formulated in terms of our criteria; and (iv) some widely believed (but never proved) separation results can be proved by using the criteria we propose. Moreover, the way in which we prove known separation results is easier than the way in which such results were originally proved.
@article{G:IC10,
author = {D. Gorla},
title = {Towards a Unified Approach to Encodability and Separation Results for Process Calculi},
journal = {Information and Computation},
volume = {},
number = {},
pages = {},
year = {2010},
publisher = {Elsevier},
}
@InProceedings{G:CONCUR08,
author = {D. Gorla},
title = {Towards a Unified Approach to Encodability and Separation Results for Process Calculi},
editor = {F. van Breugel and M. Chechik},
booktitle = {Proc. of 19th International Conference on Concurrency Theory (CONCUR'08)},
series = {LNCS},
number = {5201},
pages = {492--507},
year = {2008},
publisher = {Springer},
}