A proof system for communicating processes with value-passing
Matthew Hennessy · Formal Aspects of Computing · 1991
Abstract A proof system for a version of CCS with value-passing is proposed in which the reasoning about data is factored out from that about the structure of processes. The system is shown to be sound and complete for finite terms with respect to a denotational semantics based on Acceptance Trees.