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.
On leave from the Swedish Institute of Computer Science, Stockholm, Sweden
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Foto Afrati, Christos Papadimitriou, and George Papageorgiou. The synthesis of communication protocols. In Proceedings of the fifth ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 263–271, 1986.
Gregor von Bochmann and Reinhard Gotzhein. Deriving protocol specifications from service specifications. In Proceedings of the ACM SIGCOM Symposium, pages 148–156, 1986.
S. Brookes, C.A.R. Hoare, and W. Roscoe. A theory of communicating sequential processes. J. ACM, 31 (3):560–599, 1984.
K Bartlett, R Scantlebury, and P Wilkinson. A note on reliable full-duplex transmissions over half duplex lines. Communications of the ACM, 2(5):260–261, 1969.
E. Emerson and E. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2(3):241–266, 1982.
Mohamed Gouda and Yao-Tin Yu. Synthesis of communicating finite-state machines with guaranteed progress. IEEE Transactions on Communications, COM-32(7):779–788, 1984.
Bengt Jonsson, Zohar Manna, and Richard Waldinger. Towards deductive synthesis of dataflow networks. In Proceedings of Symposium on Logic in Computer Science, pages 26–37, 1986.
Philip Merlin and Gregor von Bochmann. On the construction of submodule specifications and communication protocols. ACM Transactions on Programming Languages and Systems, 5(1):1–25, 1983.
Robin Milner. A Calculus of Communicating Systems. Volume 92 of Lecture Notes of Computer Science, Springer Verlag, 1980.
Robin Milner. A complete inference system for a class of regular behaviours. J. of Computer System Science, 28:439–466, 1984.
Zohar Manna and Richard Waldinger. A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems, 2(1), 1980.
Zohar Manna and Pierre Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68–93, 1984.
R de Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.
M W Shields. Extending the Interface Equation. Technical Report SE/079/3, Electronic Engineering Laboratories, University of Kent at Canterbury, August 1986.
M W Shields. Solving the Interface Equation. Technical Report SE/079/2, Electronic Engineering Laboratories, University of Kent at Canterbury, July 1986.
P Zafiropulo, C H West, H Rudin, D D Cowan, and D Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, COM-28(4):651–661, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parrow, J. (1987). Submodule construction as equation solving in CCS. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_46
Download citation
DOI: https://doi.org/10.1007/3-540-18625-5_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18625-0
Online ISBN: 978-3-540-48033-4
eBook Packages: Springer Book Archive