Encoding Context-Sensitivity in Reo into Non-Context-Sensitive Semantic Models

Reo is a coordination language which can be used to model the interactions among a set of components or services in a compositional manner using connectors. The language concepts of Reo include synchronization, mutual exclusion, data manipulation, memory and contextdependency. Context-dependency facilitates the precise specification of a connector's possible actions in situations where it would otherwise exhibit nondeterministic behavior. All existing formalizations of contextdependency in Reo are based on extended semantic models that provide constructs for modeling the presence and absence of I/O requests at the ports of a connector. In this paper, we show that context-dependency in Reo can be encoded in basic semantic models, namely connector coloring with two colors and constraint automata, by introducing additional fictitious ports for Reo's primitives. Both of these models were considered as not expressive enough to handle context-dependency up to now. We demonstrate the usefulness of our approach by incorporating context-dependency into the constraint automata based Vereofy model checker.

[1]  S. Kemper,et al.  SAT-based verification for timed component connectors , 2009, Sci. Comput. Program..

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

[3]  Frank S. de Boer,et al.  Formal Methods for Components and Objects , 2012, Lecture Notes in Computer Science.

[4]  Shaghayegh Sahebi,et al.  Modeling and Analysis of Reo Connectors Using Alloy , 2008, COORDINATION.

[5]  Erik P. de Vink,et al.  Verification of Context-Dependent Channel-Based Service Models , 2009, FMCO.

[6]  Farhad Arbab,et al.  Decomposition of Constraint Automata , 2010, FACS.

[7]  D. Costa Formal models for component connectors , 2010 .

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

[9]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[10]  Christel Baier,et al.  Formal Verification for Components and Connectors , 2009, FMCO.

[11]  Dave Clarke,et al.  Decomposing port automata , 2009, SAC '09.

[12]  Christel Baier,et al.  A Uniform Framework for Modeling and Verifying Components and Connectors , 2009, COORDINATION.

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

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

[15]  Farhad Arbab,et al.  Connector colouring I: Synchronisation and context dependency , 2006, Sci. Comput. Program..

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

[17]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[18]  Christian Krause,et al.  Reconfigurable Component Connectors , 2011 .

[19]  Martin Wirsing,et al.  Extraction of Structured Programs from Specification Proofs , 1999, WADT.

[20]  Frank D. Valencia,et al.  Formal Methods for Components and Objects , 2002, Lecture Notes in Computer Science.

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