FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS

DOI10.1142/S0129054113500081zbMath1286.68298OpenAlexW2089742622MaRDI QIDQ2856009

Houguang Yue

Publication date: 23 October 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113500081

zbMATH Keywords

asynchronous pi-calculusinteraction completenessmodel independent equalitysubbisimilarity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Cites Work

• On the expressiveness of interaction
• A calculus of mobile processes. I
• On bisimulations for the asynchronous \(\pi\)-calculus
• The lazy lambda calculus in a concurrency scenario
• Testing equivalences for processes
• On the computational strength of pure ambient calculi
• What is a ``good encoding of guarded choice?
• Variations on mobile processes
• Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
• Functions as processes
• On asynchrony in name-passing calculi
• What are the Fundamental Structures of Concurrency?

This page was built for publication: FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS