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

DOI10.1142/S0129054113500081zbMATH Open1286.68298OpenAlexW2089742622MaRDI QIDQ2856009FDOQ2856009

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

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

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)

Cites Work

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

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

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)