On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi

DOI10.1007/978-3-642-14162-1_37zbMath1288.68183OpenAlexW1944468146WikidataQ57652411 ScholiaQ57652411MaRDI QIDQ3587459

Ivan Lanese, Davide Sangiorgi, Jorge A. Pérez, Alan Schmitt

Publication date: 7 September 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_37

Mathematics Subject Classification ID

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

Related Items (11)

On the Expressiveness of Symmetric Communication ⋮ On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ Theory of interaction ⋮ Expressiveness of concurrent intensionality ⋮ Parameterizing higher-order processes on names and processes ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Unnamed Item ⋮ On the relative expressiveness of higher-order session processes ⋮ On the interactive power of higher-order processes extended with parameterization ⋮ On the Relative Expressiveness of Higher-Order Session Processes

This page was built for publication: On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi