(Enter summary)
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. (Update)
Cited by: More
Probabilistic Models for Reo Connector Circuits - Baier (2005)
(Correct)
Models and Temporal Logics for Timed Component Connectors - Arbab, Baier, de Boer.. (2004)
(Correct)
Synthesis of Reo Circuits for Implementation of.. - Arbab, Baier, de.. (2005)
(Correct)
Active bibliography (related documents): More All
0.4: Modeling Component Connectors in Reo by Constraint Automata - Baier, Sirjani, Arbab.. (2004)
(Correct)
0.1: Alea jacta est - Verification of Probabilistic, Real-Time and.. - Stoelinga (2002)
(Correct)
0.1: Polynomial Time Algorithms for Testing Probabilistic Bisimulation.. - Baier (1996)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
Related documents from co-citation: More All
5: Reo: A Channel-based Coordination Model for Component Composition (context) - Arbab - 2003
5: A coinductive calculus of component connectors
- Arbab, Rutten - 2002
4: Models and temporal logics for timed component connectors
- Arbab, Baier et al. - 2004
BibTeX entry: (Update)
F. Arbab, C. Baier, J.J.M.M. Rutten, and M. Sirjani. Modeling component connectors in reo by constraint automata. In FOCLASA'03, volume 97 of ENTCS, pages 25--41, 2004. Full version see http://web.informatik.uni-bonn.de/I/baier/publikationen.html. http://citeseer.ist.psu.edu/article/arbab04modeling.html More
@misc{ arbab04modeling,
author = "F. Arbab and C. Baier and J. Rutten and M. Sirjani",
title = "Modeling component connectors in reo by constraint automata",
text = "F. Arbab, C. Baier, J.J.M.M. Rutten, and M. Sirjani. Modeling component
connectors in reo by constraint automata. In FOCLASA'03, volume 97 of ENTCS,
pages 25--41, 2004. Full version see http://web.informatik.uni-bonn.de/I/baier/publikationen.html.",
year = "2004",
url = "citeseer.ist.psu.edu/article/arbab04modeling.html" }
Citations (may not include all citations):
374
Automata on infinite objects (context) - Thomas - 1990
201
Three partition refinement algorithms (context) - Paige, Tarjan - 1987
139
introduction to inputoutput automata (context) - Tuttle, to et al. - 1989
65
Computing simulations on finite and infinite graphs
- Henzinger, Henzinger et al. - 1995
16
Concurrent timed port automata
- Grosu, Rumpe - 1995
11
A coinductive calculus of component connectors
- Arbab, Rutten - 2002
10
Reo: A channel-based coordination model for component compos.. (context) - Arbab - 2003
8
finite state processes and three problems of equivalence (context) - Kannelakis, Smolka - 1983
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://web.informatik.uni-bonn.de/I/baier/publikationen.html): More
Quantitative Analysis of Distributed Randomized Protocols - Baier, Ciesinski, Groesser (2005)
(Correct)
Symbolic Reasoning with Weighted and Normalized Decision.. - Ossowski, Baier (2005)
(Correct)
Synthesis of Reo Circuits for Implementation of.. - Arbab, Baier, de.. (2004)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC