A proof system for communicating processes with value-passing

DOI10.1007/BF01642508zbMath0736.68057MaRDI QIDQ1179808

Matthew C. B. Hennessy

Publication date: 27 June 1992

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

zbMATH Keywords

completenessproof systemCCSvalue-passingalgebraic laws

Mathematics Subject Classification ID

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

Related Items

On the expressiveness of choice quantification, Process algebra with guards: Combining hoare logic with process algebra, Axiomatising real-timed processes, A modal logic for message passing processes, A theory of bisimulation for the \(\pi\)-calculus, Revisiting sequential composition in process calculi, Symbolic transition graph with assignment, Theory of interaction, Value-passing CCS with noisy channels, Probabilistic bisimulations for quantum processes, Communicating processes with value-passing and assignments, Proof systems for message-passing process algebras, Bisimulations for a calculus of broadcasting systems, Linda-based applicative and imperative process algebras, The Value-Passing Calculus

Cites Work

• A calculus of communicating systems
• The laws of Occam programming
• Acceptance trees
• Communicating sequential processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item