Modeling component connectors in Reo by constraint automata

  • Authors:

  • Christel Baier;Marjan Sirjani;Farhad Arbab;Jan Rutten

  • Affiliations:

  • Institut für Informatik I, University of Bonn, Bonn, Germany;Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran and School of Computer Science, IPM, Tehran, Iran;Dept. of Softw. Eng., Centrum voor Wiskunde en Informatica, Kruislaan, GB Amsterdam and Leiden Inst. for Adv. Comp. Sci., Leiden Univ., Niels Bohrweg, CA Leiden and Sch. of Comp. Sci., Univ. of Wa ...;Department of Software Engineering, Centrum voor Wiskunde en Informatica, Kruislaan, GB Amsterdam, The Netherlands and Vrije Universiteit, De Boelelaan, HV Amsterdam, The Netherlands

  • Venue:
  • Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we introduce constraint automata and propose them as an operational model for Reo, an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. By providing composition operators for constraint automata and defining notions of equivalence and refinement relations for them, this paper covers the foundations for building tools to address concerns such as the automated construction of the automaton for a given component connector, equivalence checking or containment checking of the behavior of two given connectors, and verification of coordination mechanisms.