Modeling component connectors in Reo by constraint automata
From International Center for Computational Logic
Modeling component connectors in Reo by constraint automata
Christel BaierChristel Baier, Marjan SirjaniMarjan Sirjani, Farhad ArbabFarhad Arbab, Jan J. M. M. RuttenJan J. M. M. Rutten
Christel Baier, Marjan Sirjani, Farhad Arbab, Jan J. M. M. Rutten
Modeling component connectors in Reo by constraint automata
Science of Computer Programming, 61(2):75--113, 2006
Modeling component connectors in Reo by constraint automata
Science of Computer Programming, 61(2):75--113, 2006
- KurzfassungAbstract
In this paper we introduce constraint automata and propose them as an operational model for Reo, an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. By providing composition operators for constraint automata and defining notions of equivalence and refinement relations for them, this paper covers the foundations for building tools to address concerns such as the automated construction of the automaton for a given component connector, equivalence checking or containment checking of the behavior of two given connectors, and verification of coordination mechanisms. - Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science
@article{BSAR2006,
author = {Christel Baier and Marjan Sirjani and Farhad Arbab and Jan J. M. M.
Rutten},
title = {Modeling component connectors in Reo by constraint automata},
journal = {Science of Computer Programming},
volume = {61},
number = {2},
year = {2006},
pages = {75--113},
doi = {10.1016/J.SCICO.2005.10.008}
}