Reasoning about higher-order processes

DOI10.1007/3-540-59293-8_196MaRDI QIDQ5096732zbMATH OpenOpenAlexFDO

Authors Roberto M. Amadio, Mads Dam

Publication date 18 August 2022

Published in TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59293-8_196

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 4210119
• A theory of higher order communicating systems
• scientific article; zbMATH DE number 1487725
• Plain CHOCS. A second generation calculus for higher order processes
• Higher-order processes and their models

Cites work

• A domain equation for bisimulation
• A fully abstract denotational model for higher-order processes
• A modal logic for message passing processes
• Algebraic laws for nondeterminism and concurrency
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 177855 (Why is no real title available?)
• Modal logics for communicating systems
• Modal logics for mobile processes
• Plain CHOCS. A second generation calculus for higher order processes

Cited in

(6)

• Proving properties of dynamic process networks
• scientific article; zbMATH DE number 4210119 (Why is no real title available?)
• A Logic for Distributed Higher Order π-Calculus
• First-order reasoning for higher-order concurrency
• First-order semantics for higher-order processes
• A fully abstract denotational semantics for the calculus of higher-order communicating systems

This page was built for publication: Reasoning about higher-order processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096732)