Submodule Construction as Equation Solving in CCS (1989)
| Venue: | IN PROCEEDINGS OF THE FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, LECTURE NOTES IN COMPUTER SCIENCE 287 |
| Citations: | 5 - 3 self |
BibTeX
@INPROCEEDINGS{Parrow89submoduleconstruction,
author = {Joachim Parrow},
title = {Submodule Construction as Equation Solving in CCS},
booktitle = {IN PROCEEDINGS OF THE FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, LECTURE NOTES IN COMPUTER SCIENCE 287},
year = {1989},
pages = {103--123},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In top-down design methodologies the following problem arises: given specifications of a system and of some of its submodules, derive a specification for the remaining submodules. We formulate this problem in CCS as an equation (AjX)nL B, where X is unknown, B represents the whole system, A the known submodules, and L the channels over which the submodules interact. We present a procedure for solving such equations by successive transformation of equations into simpler equations in parallel with generation of a solution. The procedure has been implemented as a semiautomatic program, where the user may interact in order to guide the transformations towards particular solutions. As an example we demonstrate the automatic generation of receivers of two versions of the Alternating Bit protocol.
