Reo is a recently introduced channel-based coordination model, 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.

Distributed Systems (acm C.2.4), Concurrent Programming (acm D.1.3), Language Classifications (acm D.3.2), Language Constructs and Features (acm D.3.3), COMPUTATION BY ABSTRACT DEVICES (acm F.1), LOGICS AND MEANINGS OF PROGRAMS (acm F.3)
Software (theme 1)
CWI
Software Engineering [SEN]
Computer Security

Arbab, F, & Rutten, J.J.M.M. (2002). A coinductive calculus of component connectors. Software Engineering [SEN]. CWI.