## Submodule Construction as Equation Solving in CCS

**J. Parrow**
*Abstract:* A method for solving CCS equations of type
(*A* | *X*)\*L* approx *B*, where *X* is
unknown, is presented. The method is useful in a top-down design
methodology: if a system (*B*) and some of its submodules
(*A*) are specified, solving such an equation amounts to
constructing the missing submodules. The method works by
successively transforming equations into simpler equations, in
parallel with generation of a solution. It has been implemented as
a semi-automatic program, which has been applied to the generation
of receivers of two alternating-bit protocols.

*LFCS report
ECS-LFCS-87-26*

This report was later published in *Theoretical Computer
Science* **68**:175-202 (1989).

Previous |

Index |

Next