Formal models for component connectors
de David Oliveira Costa · 2010
configuration tables provide a definition principle for Reo connector models—an abstract configuration table θ(S,Σ) defines a Reo automaton model for a Reo connector with a set of ports Σ and a set of memory configurations S. Notation 5.2.11. Given a configuration table θ(S,Σ) (a Reo automaton (S,Σ, δ)) we denote by [[θ(S,Σ)]]R ([[(S,Σ, δ)]]T ) the Reo automaton defined by θ(S,Σ) (the configuration table defined by (S,Σ, δ)) according to the proposition above. We sometimes use the term Reo model to refer to the semantics of a connector defined by either a Reo automaton or a configuration table. Next, we define the semantics of the Conlang primitives using configuration tables, just like we did in Example 5.2.7 for the Sync. To illustrate how succinct the configuration tables are compared with the equivalent Reo automata, we also depict the labelled transition diagrams for the Reo automata denoted by the configuration tables.