Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract)

Farhad ArbabFarhad Arbab, Christel BaierChristel Baier, Jan J. M. M. RuttenJan J. M. M. Rutten, Marjan SirjaniMarjan Sirjani

DOI Link

Farhad Arbab, Christel Baier, Jan J. M. M. Rutten, Marjan Sirjani
Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract)
Electron. Notes Theor. Comput. Sci., 97:25--46, 2004

Details
Bibtex

KurzfassungAbstract
Reo is an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. Building automated tools to address such concerns as equivalence or containment of the behavior of two given connectors, verification of the behavior of a connector, etc. requires an operational semantic model suitable for model checking. In this paper we introduce constraint automata and propose them as a semantic model for Reo.
Forschungsgruppe:Research Group: Verifikation und formale quantitative Analyse„Verifikation und formale quantitative Analyse“ befindet sich nicht in der Liste (Computational Logic, Automatentheorie, Wissensverarbeitung, Knowledge-Based Systems, Knowledge Systems, Wissensbasierte Systeme, Logische Programmierung und Argumentation, Algebra und Diskrete Strukturen, Knowledge-aware Artificial Intelligence, Algebraische und logische Grundlagen der Informatik) zulässiger Werte für das Attribut „Forschungsgruppe“.Algebraic and Logical Foundations of Computer Science

@article{ABRS2004,
  author  = {Farhad Arbab and Christel Baier and Jan J. M. M. Rutten and Marjan
             Sirjani},
  title   = {Modeling Component Connectors in Reo by Constraint Automata:
             (Extended Abstract)},
  journal = {Electron. Notes Theor. Comput. Sci.},
  volume  = {97},
  year    = {2004},
  pages   = {25--46},
  doi     = {10.1016/j.entcs.2004.04.028}
}