Stronger Validity Criteria for Encoding Synchrony

Rob van Glabbeek, Ursula Goltz, Christopher Lippert, Stephan Mennicke

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

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.
Original languageEnglish
Title of host publicationThe Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy: Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday
EditorsMário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia
Place of PublicationCham
PublisherSpringer
Pages182-205
Number of pages24
ISBN (Electronic)978-3-030-31175-9
ISBN (Print)978-3-030-31174-2
DOIs
Publication statusPublished - 4 Nov 2019

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Cham
Volume11760
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords / Materials (for Non-textual outputs)

  • Process calculI
  • Expressiveness
  • Translations
  • Quality criteria for encodings
  • Valid encoding
  • Compositionality
  • Operational correspondence
  • Semantic equivalence
  • Asynchronous π-calculus

Fingerprint

Dive into the research topics of 'Stronger Validity Criteria for Encoding Synchrony'. Together they form a unique fingerprint.

Cite this