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

completeness; proof system; CCS; value-passing; algebraic laws

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

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