an:00943661
Zbl 0857.68040
Hennessy, M.; Lin, H.
Proof systems for message-passing process algebras
EN
Formal Asp. Comput. 8, No. 4, 379-407 (1996).
00035092
1996
j
68Q05
bisimulation; message-passing; process algebra
Summary: We give sound and complete proof systems for a variety of bisimulation based equivalences over a message-passing process algebra. The process algebra is a generalisation of pure \(CCS\) where the actions consist of receiving and sending messages or data on communication channels; the standard prefixing operator a.p is replaced by the two operators \(c?x.p\) and \(c!e.p\) and in addition messages can be tested by a conditional construct. The various proof systems are parametrised on auxiliary proof systems for deciding on equalities or more general boolean identities over the expression language for data. The completeness of these proof systems are thus relative to the completeness of the auxiliary proof systems.