Correlating Formal Semantic Models of Reo Connectors: Connector Coloring and Constraint Automata

@inproceedings{Jongmans2011CorrelatingFS,
  title={Correlating Formal Semantic Models of Reo Connectors: Connector Coloring and Constraint Automata},
  author={Sung-Shik T. Q. Jongmans and F. Arbab},
  booktitle={ICE},
  year={2011}
}
  • Sung-Shik T. Q. Jongmans, F. Arbab
  • Published in ICE 2011
  • Computer Science
  • Over the past decades, coordination languages have emerged for the specification and implementation of interaction protocols for communicating software components. This class of languages includes Reo, a platform for compositional construction of connectors. In recent years, various formalisms for describing the behavior of Reo connectors have come to existence, each of them serving its own purpose. Naturally, questions about how these models relate to each other arise. From a theoretical point… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 20 REFERENCES
    Automata for Context-Dependent Connectors
    42
    Formal Verification for Components and Connectors
    23
    Modeling component connectors in Reo by constraint automata
    326
    Connectors as Designs
    8
    Reo: a channel-based coordination model for component composition
    747
    Tiles for Reo
    31
    Formal models for component connectors
    70
    Abstract Behavior Types: A Foundation Model for Components and Their Composition
    161
    A Coinductive Calculus of Component Connectors
    179