From computing to interaction: on the expressiveness of asynchronous pi-calculus

DOI10.1142/S0129054113500081MaRDI QIDQ2856009zbMATH OpenOpenAlexFDO

Authors 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) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Recommendations

• Synchrony vs causality in the asynchronous \(\pi\)-calculus
• On the expressiveness of interaction
• On the Asynchronous Nature of the Asynchronous π-Calculus
• Theory by process
• On bisimulations for the asynchronous π-calculus

Cites work

• A calculus of mobile processes. I
• Functions as processes
• Linearity, persistence and testing semantics in the asynchronous pi-calculus
• On asynchrony in name-passing calculi
• On bisimulations for the asynchronous -calculus
• On the computational strength of pure ambient calculi
• On the expressiveness of interaction
• Testing equivalences for processes
• The lazy lambda calculus in a concurrency scenario
• Variations on mobile processes
• What are the fundamental structures of concurrency? We still don't know!
• What is a ``good encoding of guarded choice?

Cited in

(2)

• scientific article; zbMATH DE number 1670841 (Why is no real title available?)
• scientific article; zbMATH DE number 7453965 (Why is no real title available?)

This page was built for publication: From computing to interaction: on the expressiveness of asynchronous pi-calculus

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