Comparing Process Calculi Using Encodings

Kirstin Peters
(TU Berlin/TU Darmstadt)

Encodings or the proof of their absence are the main way to compare process calculi. To analyse the quality of encodings and to rule out trivial or meaningless encodings, they are augmented with encodability criteria. There exists a bunch of different criteria and different variants of criteria in order to reason in different settings. This leads to incomparable results. Moreover, it is not always clear whether the criteria used to obtain a result in a particular setting do indeed fit to this setting. This paper provides a short survey on often used encodability criteria, general frameworks that try to provide a unified notion of the quality of an encoding, and methods to analyse and compare encodability criteria.

Invited Presentation in Jorge A. Pérez and Jurriaan Rot: Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics (EXPRESS/SOS 2019), Amsterdam, The Netherlands, 26th August 2019, Electronic Proceedings in Theoretical Computer Science 300, pp. 19–38.
Published: 22nd August 2019.

ArXived at: http://dx.doi.org/10.4204/EPTCS.300.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org