Stronger Validity Criteria for Encoding Synchrony

DOI10.1007/978-3-030-31175-9_11MaRDI QIDQ6489021zbMATH OpenFDO

Authors Rob van Glabbeek, Ursula Goltz, Stephan Mennicke

Publication date 14 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-31175-9_11

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the validity of encodings of the synchronous in the asynchronous -calculus
• Synchrony vs causality in the asynchronous -calculus
• Decoding choice encodings
• What is a ``good encoding of guarded choice?
• Decoding choice encodings

Cited in

(2)

• scientific article; zbMATH DE number 7453965 (Why is no real title available?)
• Minimal translations from synchronous communication to synchronizing locks

This page was built for publication: Stronger Validity Criteria for Encoding Synchrony

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489021)