Abstract
A method for solving CCS equations of type (A|X)\L≈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.
Cite
CITATION STYLE
Parrow, J. (1987). Submodule construction as equation solving in CCS. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 287 LNCS, pp. 103–123). Springer Verlag. https://doi.org/10.1007/3-540-18625-5_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
