On the expressiveness and decidability of higher-order process calculi

DOI10.1016/j.ic.2010.10.001zbMath1238.68100OpenAlexW2098401737WikidataQ57652407 ScholiaQ57652407MaRDI QIDQ627133

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

Publication date: 21 February 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://www.rug.nl/research/portal/en/publications/on-the-expressiveness-and-decidability-of-higherorder-process-calculi(7a09b8c8-2aae-49a2-8307-850af5963435).html

zbMATH Keywords

bisimulationexpressivenessprocess calculihigher-order communicationHOcore

Mathematics Subject Classification ID

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

Related Items

Characteristic bisimulation for higher-order session processes, HOCore in Coq, Distinguishing and relating higher-order and first-order processes by expressiveness, Unique parallel decomposition in branching and weak bisimulation semantics, Parameterizing higher-order processes on names and processes, More on bisimulations for higher order \(\pi\)-calculus, Unnamed Item, Unnamed Item, Using session types for reasoning about boundedness in the \(\pi\)-calculus, The \(C_\pi\)-calculus: a model for confidential name passing, On the expressiveness of interaction, 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, Normal Bisimulations in Calculi with Passivation, Unnamed Item, On parameterization of higher-order processes, Categorical specification and implementation of replicated data types

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• First-order reasoning for higher-order concurrency
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Undecidability of bisimilarity for Petri nets and some related problems
• Bisimulation for higher-order process calculi
• Unique decomposition of processes
• On bisimulations for the asynchronous \(\pi\)-calculus
• Plain CHOCS. A second generation calculus for higher order processes
• The lazy lambda calculus in a concurrency scenario
• On reduction-based process semantics
• On the expressive power of movement and restriction in pure mobile ambients
• An efficient algorithm for computing bisimulation equivalence
• Proving congruence of bisimulation in functional programming languages
• Symmetric electoral systems for ambient calculi
• On the Relative Expressive Power of Calculi for Mobility
• Howe’s Method for Calculi with Passivation
• On the Expressiveness of Forwarding in Higher-Order Communication
• A Distribution Law for CCS and a New Congruence Result for the pi-calculus
• On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
• Normal Bisimulations in Calculi with Passivation
• On the expressive power of recursion, replication and iteration in process calculi
• Decidable Fragments of a Higher Order Calculus with Locations
• Barbed bisimulation
• Contextual equivalence for higher-order pi-calculus revisited
• Global Computing
• Equivalence-checking on infinite-state systems: Techniques and results
• Computability of Recursive Functions
• A variant of a recursively unsolvable problem
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Foundations of Software Science and Computation Structures