Reasoning about higher-order processes

DOI10.1007/3-540-59293-8_196zbMATH Open1496.68211OpenAlexW1540321537MaRDI QIDQ5096732FDOQ5096732

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

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

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)

Cites Work

• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Modal logics for mobile processes
• A domain equation for bisimulation
• Modal logics for communicating systems
• Plain CHOCS. A second generation calculus for higher order processes
• A fully abstract denotational model for higher-order processes
• Title not available (Why is that?)
• A modal logic for message passing processes

Cited In (5)

• A fully abstract denotational semantics for the calculus of higher-order communicating systems
• Proving properties of dynamic process networks
• First-order semantics for higher-order processes
• First-order reasoning for higher-order concurrency
• A Logic for Distributed Higher Order π-Calculus

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)