A proof system for communicating processes with value-passing

DOI10.1007/BF01642508MaRDI QIDQ1179808zbMATH OpenFDO

Authors Matthew Hennessy

Publication date 27 June 1992

Published in Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

completenessCCSproof systemvalue-passingalgebraic laws

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 4205976
• A theory of communicating processes with value passing
• scientific article; zbMATH DE number 177815
• Proof systems for message-passing process algebras

Cites work

• scientific article; zbMATH DE number 4205976 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• A calculus of communicating systems
• Acceptance trees
• Communicating sequential processes
• The laws of Occam programming

Cited in

(21)

• A theory of bisimulation for the \(\pi\)-calculus
• Probabilistic bisimulations for quantum processes
• Branching bisimulation semantics for quantum processes
• Theory of interaction
• Revisiting sequential composition in process calculi
• On the expressiveness of choice quantification
• scientific article; zbMATH DE number 177815 (Why is no real title available?)
• Axiomatising real-timed processes
• Bisimulations for a calculus of broadcasting systems
• Formalising a value-passing calculus in H0L
• A modal logic for message passing processes
• Communicating processes with value-passing and assignments
• Proof systems for message-passing process algebras
• A theory of communicating processes with value passing
• Planning proofs of equations in CCS
• Process algebra with guards: Combining hoare logic with process algebra
• A symbolic approach to value-passing processes
• The Value-Passing Calculus
• Symbolic transition graph with assignment
• Linda-based applicative and imperative process algebras
• Value-passing CCS with noisy channels

This page was built for publication: A proof system for communicating processes with value-passing

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