Abstract
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.
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
Arbab, F., Mavaddat, F.: Coordination through channel composition. In: Arbab, F., Talcott, C. (eds.) COORDINATION 2002. LNCS, vol. 2315, p. 22. Springer, Heidelberg (2002)
Arbab, F.: A channel-based coordination model for component composition. Report SEN-R0203, CWI (2002), Available at URL, http://www.cwi.nl
Barbosa, L.: Components as Coalgebras. PhD thesis, Universidade do Minho, Braga, Portugal (2001)
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)
Broy, M., Stølen, K.: Specification and development of interactive systems. Monographs in Computer Science, vol. 62. Springer, Heidelberg (2001)
Doberkat, E.-E.: Pipes and filters: modelling a software architecture through relations. Report 123, Chair for software technology, University of Dortmund (2002)
Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS 62, 222–259 (1997), Available at URL: www.cwi.nl/~janr
Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Park, D.M.R.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981)
Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000)
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)
Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285–309 (1955)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arbab, F., Rutten, J.J.M.M. (2003). A Coinductive Calculus of Component Connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds) Recent Trends in Algebraic Development Techniques. WADT 2002. Lecture Notes in Computer Science, vol 2755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40020-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-40020-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20537-1
Online ISBN: 978-3-540-40020-2
eBook Packages: Springer Book Archive