Advertisement

A Coinductive Calculus of Component Connectors

  • F. Arbab
  • J. J. M. M. Rutten
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2755)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AM02]
    Arbab, F., Mavaddat, F.: Coordination through channel composition. In: Arbab, F., Talcott, C. (eds.) COORDINATION 2002. LNCS, vol. 2315, p. 22. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. [Arb02]
    Arbab, F.: A channel-based coordination model for component composition. Report SEN-R0203, CWI (2002), Available at URL, http://www.cwi.nl
  3. [Bar01]
    Barbosa, L.: Components as Coalgebras. PhD thesis, Universidade do Minho, Braga, Portugal (2001)Google Scholar
  4. [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
  5. [BS01]
    Broy, M., Stølen, K.: Specification and development of interactive systems. Monographs in Computer Science, vol. 62. Springer, Heidelberg (2001)CrossRefzbMATHGoogle Scholar
  6. [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
  7. [JR97]
    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 zbMATHGoogle Scholar
  8. [Mil80]
    Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)CrossRefzbMATHGoogle Scholar
  9. [Par81]
    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)CrossRefGoogle Scholar
  10. [Rut00]
    Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  11. [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
  12. [Tar55]
    Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285–309 (1955)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • F. Arbab
    • 1
  • J. J. M. M. Rutten
    • 1
    • 2
  1. 1.CWIAmsterdamThe Netherlands
  2. 2.Division of Mathematics and Computer ScienceFaculty of Sciences, Vrije UniversiteitAmsterdamThe Netherlands

Personalised recommendations