A Coinductive Calculus of Component Connectors
Reo is a recently introduced channel-based model for coordination, wherein complex coordinators, called connectors, are compositionally built out of simpler ones. Using a more liberal notion of a channel, Reo generalises existing dataflow networks. In this paper, we present a simple and transparent semantical model for Reo, in which connectors are relations on timed data streams. Timed data streams constitute a characteristic of our model and consist of twin pairs of separate data and time streams. Furthermore, coinduction is our main reasoning principle and we use it to prove properties such as connector equivalence.
Unable to display preview. Download preview PDF.
- [Arb02]Arbab, F.: A channel-based coordination model for component composition. Report SEN-R0203, CWI (2002), Available at URL, http://www.cwi.nl
- [Bar01]Barbosa, L.: Components as Coalgebras. PhD thesis, Universidade do Minho, Braga, Portugal (2001)Google Scholar
- [BRP86]Barringer, H., Kuiper, R., Pnueli, A.: A really abstract concurrent model and its temporal logic. In: Proceedings of the 13th Annual ACM Symposium on Principles of Programming Languages, pp. 173–183. ACM, New York (1986)Google Scholar
- [Dob02]Doberkat, E.-E.: Pipes and filters: modelling a software architecture through relations. Report 123, Chair for software technology, University of Dortmund (2002)Google Scholar
- [Rut01]Rutten, J.J.M.M.: Elements of stream calculus (an extensive exercise in coinduction). In: Brooks, S., Mislove, M. (eds.) Proceedings of MFPS 2001: Seventeenth Conference on the Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science, vol. 45, pp. 1–66. Elsevier Science Publishers, Amsterdam (2001)Google Scholar