On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus

DOI10.1016/j.ipl.2018.04.015zbMath1390.68490arXiv1802.09182OpenAlexW2962928782MaRDI QIDQ1641151

Robert J. van Glabbeek

Publication date: 15 June 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.09182

zbMATH Keywords

expressivenessconcurrency\(\pi\)-calculusprocess calculiquality criteria for encodings

Mathematics Subject Classification ID

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

Related Items

On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus, Expressiveness of concurrent intensionality, Unnamed Item

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A taxonomy of process calculi for distribution and mobility
• Algèbre de processus et synchronisation
• Calculi for synchrony and asynchrony
• Higher-level synchronising devices in Meije-SCCS
• A calculus of communicating systems
• A calculus of mobile processes. II
• On the expressiveness of internal mobility in name-passing calculi
• Testing equivalences for processes
• Mobile ambients
• On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus
• What is a ``good encoding of guarded choice?
• Decoding choice encodings
• Towards a unified approach to encodability and separation results for process calculi
• Tutorial on separation results in process calculi via leader election problems
• Separation of synchronous and asynchronous communication via testing
• Symmetric electoral systems for ambient calculi
• Leader election in rings of ambient processes
• Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
• Matching Systems for Concurrent Calculi
• Is It a “Good” Encoding of Mixed Choice?
• Expressiveness via Intensionality and Concurrency
• Breaking symmetries
• On the Expressiveness of Symmetric Communication
• On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
• An expressiveness study of priority in process calculi
• On the expressive power of recursion, replication and iteration in process calculi
• A Theory of Communicating Sequential Processes
• Functions as processes
• Divergence and fair testing
• From π-calculus to higher-order π-calculus — and back
• On Distributability in Process Calculi