Comparing the expressiveness of the \(\pi \)-calculus and CCS

DOI10.1007/978-3-030-99336-8_20zbMath1528.68258arXiv2203.11519OpenAlexW4225805607MaRDI QIDQ6166803

Robert J. van Glabbeek

Publication date: 3 August 2023

Published in: Programming Languages and Systems (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cool congruence formats for weak bisimulations
• Symbolic bisimulations
• Modal logics for mobile processes
• Algèbre de processus et synchronisation
• Calculi for synchrony and asynchrony
• Higher-level synchronising devices in Meije-SCCS
• A calculus of mobile processes. I
• A calculus of mobile processes. II
• A \(\pi\)-calculus with explicit substitutions
• A theory of encodings and expressiveness (extended abstract)
• On the expressiveness of choice quantification
• A theory of bisimulation for the \(\pi\)-calculus
• Towards a unified approach to encodability and separation results for process calculi
• CSP is Expressive Enough for π
• A Theory of Communicating Sequential Processes
• Process Algebra
• Functions as processes
• Branching time and abstraction in bisimulation semantics
• Barbed bisimulation
• On Distributability in Process Calculi
• Full abstraction for expressiveness: history, myths and facts
• General conditions for full abstraction
• Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi

This page was built for publication: Comparing the expressiveness of the \(\pi \)-calculus and CCS