Abstract
Several specifications of bounded buffers are given. The specifications are discussed with respect to the question of robustness and reliability. It is shown that under certain conditions bounded buffers can be composed such that we obtain bounded buffers again. Thus a functional, composition- oriented treatment of communicating systems is demonstrated by a simple example.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. A. Bergstra and J. V. Tucker. Top-down design and the algebra of communicating processes. Science of Computer Programming, 5: 171–199, 1985.
M. Broy. Algebraic methods for program construction: the project CIP. In P. Pepper, editor, Program Transformation and Programming Environments, pages 199–222, Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1984. NATO ASI Series, Series F: 8.
M. Broy. Specification and top down design of distributed programs. In H. Ehrig et al., editors, TAPS OFT 85, pages 4–28, Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1985. Lecture Notes in Computer Science, Vol. 185.
M. Broy. Views of queues. Science of Computer Programming, 11: 65–86, 1988.
C. B. Jones . Specification and design of (parallel) programs. Information Processing, 83:321–392, 1983. ( Editor R. E. A. Mason).
S. Kaplan and A. Pnueli. Specification and implementation of concurrently accessed data structures: an abstract data type approach. In F. J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, STACS 87, pages 220–244, Springer-Verlag, 1987. Lecture Notes in Computer Science, Vol. 247.
L. Lamport. A simple approach to specifying concurrent systems. DIGITAL Systems Research Report 15, December 1986. ( See also: CACM 32: 1 ).
M. L. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, 1967.
J. Misra. Specifications of concurrently accessed data. In Jan L. A. van de Snepscheut, editor, Mathematics of Program Construction, pages 91–114, Springer-Verlag, 1989. Lecture Notes in Computer Science, Vol. 375.
S. Owicki. Specifications and proofs for abstract data types in concurrent programs. In F. L. Bauer and M. Broy, editors, Program Construction, pages 174–197, Springer-Verlag, 1979. Lecture Notes in Computer Science, Vol. 69.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Broy, M. (1990). On Bounded Buffers: Modularity, Robustness, and Reliability in Reactive Systems. In: Feijen, W.H.J., van Gasteren, A.J.M., Gries, D., Misra, J. (eds) Beauty Is Our Business. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4476-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4476-9_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8792-6
Online ISBN: 978-1-4612-4476-9
eBook Packages: Springer Book Archive