Distinguishing and relating higher-order and first-order processes by expressiveness

DOI10.1007/s00236-012-0168-9zbMath1276.68129MaRDI QIDQ1935453

Xian Xu

Publication date: 15 February 2013

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-012-0168-9

zbMATH Keywords

pi-calculus; first-order processes; higher-order processes

Mathematics Subject Classification ID

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

Related Items

Unnamed Item, Unnamed Item, On parameterization of higher-order processes, Parameterizing higher-order processes on names and processes, Theory of interaction, On the interactive power of higher-order processes extended with parameterization, A thesis for interaction, On the relative expressiveness of higher-order session processes, On the Relative Expressiveness of Higher-Order Session Processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On quasi-open bisimulation
• On the expressiveness and decidability of higher-order process calculi
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Bisimulation for higher-order process calculi
• On the expressiveness of interaction
• A calculus of mobile processes. I
• Plain CHOCS. A second generation calculus for higher order processes
• Branching bisimilarity is an equivalence indeed!
• Decoding choice encodings
• A theory of bisimulation for the \(\pi\)-calculus
• A CPS encoding of name-passing in higher-order mobile embedded resources
• The seal calculus
• The m-calculus
• Branching Bisimilarity with Explicit Divergence
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
• On Bisimulation Theory in Linear Higher-Order π-Calculus
• Functions as processes
• On the bisimulation proof method
• Branching time and abstraction in bisimulation semantics
• Global Computing
• Automata, Languages and Programming
• Automata, Languages and Programming