On parameterization of higher-order processes

DOI10.1080/00207160.2016.1210793zbMath1409.68191OpenAlexW2467579942MaRDI QIDQ4976336

Qiang Yin, Huan Long, Xian Xu

Publication date: 28 July 2017

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2016.1210793

zbMATH Keywords

parameterizationexpressivenesscontext bisimulationhigher-order process calculinormal bisimulation

Mathematics Subject Classification ID

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

Related Items (1)

Parameterizing higher-order processes on names and processes

Cites Work

• Unnamed Item
• On the expressiveness and decidability of higher-order process calculi
• Characterizing contextual equivalence in calculi with passivation
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Bisimulation for higher-order process calculi
• A calculus of mobile processes. I
• Plain CHOCS. A second generation calculus for higher order processes
• Mobile ambients
• Distinguishing and relating higher-order and first-order processes by expressiveness
• A CPS encoding of name-passing in higher-order mobile embedded resources
• On the Relative Expressive Power of Calculi for Mobility
• Expressiveness of Process Algebras
• A Distributed Pi-Calculus
• On Bisimulation Theory in Linear Higher-Order π-Calculus
• Functions as processes
• On the bisimulation proof method
• Contextual equivalence for higher-order pi-calculus revisited

This page was built for publication: On parameterization of higher-order processes