Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications

Aus International Center for Computational Logic
Version vom 25. Februar 2025, 15:37 Uhr von Johannes Lehmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Farhad |ErsterAutorNachname=Arbab |FurtherAuthors=Christel Baier; Frank S. de Boer; Jan J. M. M. Rutten; Marjan Sirjani}} {{Inproceedings |Booktitle=Proc. of the 7th International Conference on Coordination Models and Languages (COORD) |Pages=236--251 |Publisher=Springer |Series=Lecture Notes in Computer Science |Title=Synthesis of Reo Circuits for Implementation of Component-Connector Automata Speci…“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

Toggle side column

Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications

Farhad ArbabFarhad Arbab,  Christel BaierChristel Baier,  Frank S. de BoerFrank S. de Boer,  Jan J. M. M. RuttenJan J. M. M. Rutten,  Marjan SirjaniMarjan Sirjani
Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten, Marjan Sirjani
Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications
Proc. of the 7th International Conference on Coordination Models and Languages (COORD), volume 3454 of Lecture Notes in Computer Science, 236--251, 2005. Springer
  • KurzfassungAbstract
    Composition of a concurrent system out of components involves coordination of their mutual interactions. In component-based construction, this coordination becomes the responsibility of the glue-code language and its underlying run-time middle-ware. Reo offers an expressive glue-language for construction of coordinating component connectors out of primitive channels. In this paper we consider the problem of synthesizing Reo coordination code from a specification of a behavior as a relation on scheduled-data streams. The specification is given as a constraint automaton that describes the desired input/output behavior at the ports of the components. The main contribution in this paper is an algorithm that generates Reo code from a given constraint automaton.
  • 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
The final publication is available at Springer via http://dx.doi.org/10.1007/11417019_16.
@inproceedings{ABBRS2005,
  author    = {Farhad Arbab and Christel Baier and Frank S. de Boer and Jan J.
               M. M. Rutten and Marjan Sirjani},
  title     = {Synthesis of Reo Circuits for Implementation of
               Component-Connector Automata Specifications},
  booktitle = {Proc. of the 7th International Conference on Coordination Models
               and Languages (COORD)},
  series    = {Lecture Notes in Computer Science},
  volume    = {3454},
  publisher = {Springer},
  year      = {2005},
  pages     = {236--251},
  doi       = {10.1007/11417019_16}
}