Stronger Validity Criteria for Encoding Synchrony
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910825487269888 |
|---|---|
| author | van Glabbeek, Rob Goltz, Ursula Lippert, Christopher Mennicke, Stephan |
| author_facet | van Glabbeek, Rob Goltz, Ursula Lippert, Christopher Mennicke, Stephan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_08307 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Stronger Validity Criteria for Encoding Synchrony van Glabbeek, Rob Goltz, Ursula Lippert, Christopher Mennicke, Stephan Logic in Computer Science F.3.2 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. |
| title | Stronger Validity Criteria for Encoding Synchrony |
| topic | Logic in Computer Science F.3.2 |
| url | https://arxiv.org/abs/2502.08307 |