Stronger Validity Criteria for Encoding Synchrony
Logic in Computer Science
2025-02-14 v2
Abstract
We analyse two translations from the synchronous into the asynchronous -calculus, both without choice, that are often quoted as standard examples of valid encodings, showing that the asynchronous -calculus is just as expressive as the synchronous one. We examine which of the quality criteria for encodings from the literature support the validity of these translations. Moreover, we prove their validity according to much stronger criteria than considered previously in the literature.
Keywords
Cite
@article{arxiv.2502.08307,
title = {Stronger Validity Criteria for Encoding Synchrony},
author = {Rob van Glabbeek and Ursula Goltz and Christopher Lippert and Stephan Mennicke},
journal= {arXiv preprint arXiv:2502.08307},
year = {2025}
}
Comments
Written in 2019. Dedicated to Catuscia Palamidessi, on the occasion of her 60th birthday