Modeling component connectors in Reo by constraint automata

F. Arbab; C. Baier; J.J.M.M. Rutten; M. Sirjani

doi:10.1016/j.entcs.2004.04.028

Modeling component connectors in Reo by constraint automata

F. Arbab
, C. Baier
, J.J.M.M. Rutten
, M. Sirjani

Research output: Contribution to Journal › Article › Academic › peer-review

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. © 2004 Elsevier B.V. All rights reserved.

Original language	English
Journal	Electronic Notes in Theoretical Computer Science
Volume	97
DOIs	https://doi.org/10.1016/j.entcs.2004.04.028
Publication status	Published - 2003

Bibliographical note

ABRS03
Proceedings title: Proceedings of FOCLASA 2003
Publisher: Elsevier

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 16 Peace, Justice and Strong Institutions

Access to Document

10.1016/j.entcs.2004.04.028

Persistent URL (handle)

Persistent link

Cite this

@article{cea777f72e164d478f5f672f443a1646,

title = "Modeling component connectors in Reo by constraint automata",

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. {\textcopyright} 2004 Elsevier B.V. All rights reserved.",

author = "F. Arbab and C. Baier and J.J.M.M. Rutten and M. Sirjani",

note = "ABRS03 Proceedings title: Proceedings of FOCLASA 2003 Publisher: Elsevier",

year = "2003",

doi = "10.1016/j.entcs.2004.04.028",

language = "English",

volume = "97",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Modeling component connectors in Reo by constraint automata

AU - Arbab, F.

AU - Baier, C.

AU - Rutten, J.J.M.M.

AU - Sirjani, M.

N1 - ABRS03 Proceedings title: Proceedings of FOCLASA 2003 Publisher: Elsevier

PY - 2003

Y1 - 2003

N2 - 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. © 2004 Elsevier B.V. All rights reserved.

AB - 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. © 2004 Elsevier B.V. All rights reserved.

U2 - 10.1016/j.entcs.2004.04.028

DO - 10.1016/j.entcs.2004.04.028

M3 - Article

SN - 1571-0661

VL - 97

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

ER -

Modeling component connectors in Reo by constraint automata

Abstract

Bibliographical note

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this