Büchi automata for modeling component connectors

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.

[1]  Orna Kupferman,et al.  Verification of Fair Transition Systems , 1998, Chic. J. Theor. Comput. Sci..

[2]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

[3]  Farhad Arbab,et al.  Coordination Models and Languages , 1998, Adv. Comput..

[4]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[5]  Christel Baier,et al.  Stochastic Reasoning About Channel-Based Component Connectors , 2006, COORDINATION.

[6]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[7]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[8]  Alexandra Silva,et al.  Automata for Context-Dependent Connectors , 2009, COORDINATION.

[9]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[10]  Clemens A. Szyperski,et al.  Component software - beyond object-oriented programming , 2002 .

[11]  Farhad Arbab,et al.  A Coinductive Calculus of Component Connectors , 2002, WADT.

[12]  하수철,et al.  [서평]「Component Software」 - Beyond Object-Oriented Programming - , 2000 .

[13]  Christel Baier,et al.  Synthesis of Reo circuits , 2005 .

[14]  Christel Baier,et al.  Models and temporal logics for timed component connectors , 2004, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004..

[15]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[16]  Christel Baier,et al.  Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications , 2005, COORDINATION.

[17]  Stephan Merz,et al.  Model Checking , 2000 .

[18]  Dave Clarke,et al.  Coordination: Reo, Nets, and Logic , 2007, FMCO.

[19]  Donald M. Kaplan,et al.  Regular Expressions and the Equivalence of Programs , 1969, J. Comput. Syst. Sci..

[20]  Marcello M. Bonsangue,et al.  Modeling Component Connectors: Synchronisation and Context-Dependency , 2008, 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods.

[21]  Farhad Arbab,et al.  Formal Semantics and Analysis of Component Connectors in Reo , 2006, FOCLASA.

[22]  Joseph Sifakis,et al.  The Algebra of Connectors - Structuring Interaction in BIP , 2008, IEEE Trans. Computers.

[23]  Farhad Arbab,et al.  Connector Colouring I: Synchronisation and Context Dependency , 2006, Electron. Notes Theor. Comput. Sci..

[24]  Christel Baier,et al.  Modeling component connectors in Reo by constraint automata , 2004, Sci. Comput. Program..

[25]  D. Kozen.  Automata on Guarded Strings and Applications , 2001 .

[26]  Farhad Arbab,et al.  Component Connectors with QoS Guarantees , 2007, COORDINATION.

[27]  Orna Kupferman,et al.  Verification of Fair Transisiton Systems , 1996, CAV.

[28]  Farhad Arbab,et al.  Reo: A Channel-based Coordination Model for Component Composition , 2005 .

[29]  Marcello M. Bonsangue,et al.  Recasting Constraint Automata into Büchi Automata , 2008, ICTAC.