Büchi automata for modeling component connectors

  • Authors:

  • Mohammad Izadi;Marcello Bonsangue;Dave Clarke

  • Affiliations:

  • Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands and Institute for Humanities and Cultural Studies (IHCS), Tehran, Iran;Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands;Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium

  • Venue:
  • Software and Systems Modeling (SoSyM)
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Reo is an exogenous coordination language for component connectors extending data flow networks with synchronization and context-dependent behavior. The first proposed formalism to capture the operational semantics of Reo is called constraint automaton. In this paper, we propose another operational model of Reo based on Büchi automata in which port synchronization is modeled by records labeling the transitions, whereas context dependencies are stored in the states. It is shown that constraint automata can be recast into our proposed Büchi automata of records. Also, we provide a composition operator which models the joining of two connectors and show that it can be obtained by using two standard operators: alphabet extension and automata product. Our semantics has the advantage over previous models in that it is based on standard automata theory, so that existing theories and tools can be easily reused. Moreover, it is the first formal model addressing all of Reo's features: synchronization, mutual exclusion, hiding, and context-dependency.