Recursive equations in higher-order process calculi

DOI10.1016/S0304-3975(00)00378-9zbMath0992.68147MaRDI QIDQ5958778

Martin Wirsing, Ming Sheng Ying

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (1)

\(\pi\)-calculus with noisy channels

Cites Work

• Unnamed Item
• Unnamed Item
• Confluence for process verification
• Bisimulation for higher-order process calculi
• A calculus of communicating systems
• A calculus of mobile processes. II
• A shorter proof to uniqueness of solutions of equations
• Plain CHOCS. A second generation calculus for higher order processes
• A fully abstract denotational model for higher-order processes
• A theory of higher order communicating systems
• Weak confluence and \(\tau\)-inertness
• Higher-order processes and their models
• A fully abstract denotational semantics for the calculus of higher-order communicating systems

This page was built for publication: Recursive equations in higher-order process calculi