Analysing and Comparing Encodability Criteria

Kirstin Peters
Rob van Glabbeek

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 quality 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. We show how to formally reason about and compare encodability criteria by mapping them on requirements on a relation between source and target terms that is induced by the encoding function. In particular we analyse the common criteria full abstraction, operational correspondence, divergence reflection, success sensitiveness, and respect of barbs; e.g. we analyse the exact nature of the simulation relation (coupled simulation versus bisimulation) that is induced by different variants of operational correspondence. This way we reduce the problem of analysing or comparing encodability criteria to the better understood problem of comparing relations on processes.

In Silvia Crafa and Daniel E. Gebler: Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics (EXPRESS/SOS 2015), Madrid, Spain, 31st August 2015, Electronic Proceedings in Theoretical Computer Science 190, pp. 46–60.
The Isabelle/HOL source files, and a full proof document, are available in the Archive of Formal Proofs, at this http URL
Published: 26th August 2015.

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