Article848695140: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Johannes Lehmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Farhad |ErsterAutorNachname=Arbab |FurtherAuthors=Christel Baier; Jan J. M. M. Rutten; Marjan Sirjani}} {{Article |Journal=Electron. Notes Theor. Comput. Sci. |Pages=25--46 |Title=Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract) |Volume=97 |Year=2004 }} {{Publikation Details |DOI Name=10.1016/j.entcs.2004.04.028 |Abstract=Reo is an exogenous coordination language f…“) |
Johannes Lehmann (Diskussion | Beiträge) K (Textersetzung - „Verifikation und formale quantitative Analyse“ durch „Algebraische und logische Grundlagen der Informatik“) |
||
| Zeile 13: | Zeile 13: | ||
|DOI Name=10.1016/j.entcs.2004.04.028 | |DOI Name=10.1016/j.entcs.2004.04.028 | ||
|Abstract=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. | |Abstract=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= | |Forschungsgruppe=Algebraische und logische Grundlagen der Informatik | ||
}} | }} | ||
Aktuelle Version vom 5. März 2025, 14:44 Uhr
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
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
Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract)
Electron. Notes Theor. Comput. Sci., 97:25--46, 2004
- 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: Algebraische und logische Grundlagen der InformatikAlgebraic 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}
}
