The Reo coordination language Reo presents a paradigm for composition of distributed software components and services based on the notion of mobile channels. Reo enforces an exogenous channel-based coordination model that defines how designers can build complex coordinators, called connectors, out of simpler ones. Application designers can use Reo as a ”glue code” language for compositional construction of connectors that orchestrate the cooperative behavior of instances of components or services in a component-based system or a service-oriented application.

References in zbMATH (referenced in 59 articles , 1 standard article )

Showing results 1 to 20 of 59.
Sorted by year (citations)

1 2 3 next

  1. Dokter, Kasper; Jongmans, Sung-Shik; Arbab, Farhad; Bliudze, Simon: Combine and conquer: relating BIP and Reo (2017)
  2. Attie, Paul; Baranov, Eduard; Bliudze, Simon; Jaber, Mohamad; Sifakis, Joseph: A general framework for architecture composability (2016)
  3. Cassel, Sofia; Howar, Falk; Jonsson, Bengt; Steffen, Bernhard: Active learning for extended finite state machines (2016)
  4. Oliveira, Marcel V.M.; Antonino, P.; Ramos, R.; Sampaio, A.; Mota, A.; Roscoe, A.W.: Rigorous development of component-based systems using component metadata and patterns (2016)
  5. Aceto, Luca; Goriac, Eugen-Ioan; Ingolfsdottir, Anna: A ground-complete axiomatization of stateless bisimilarity over Linda (2015)
  6. Klein, Joachim; Baier, Christel; Klüppelholz, Sascha: Compositional construction of most general controllers (2015)
  7. Bruni, Roberto; Melgratti, Hernan; Montanari, Ugo; Sobocinski, Pawel: Connector algebras for C/E and P/T nets’ interactions (2013)
  8. Bonakdarpour, Borzoo; Bozga, Marius; Jaber, Mohamad; Quilbeuf, Jean; Sifakis, Joseph: A framework for automated distributed implementation of component-based models (2012)
  9. Bonsangue, Marcello; Clarke, Dave; Silva, Alexandra: A model of context-dependent component connectors (2012)
  10. Groote, Jan Friso; Kouters, Tim W.D.M.; Osaiweran, Ammar: Specification guidelines to avoid the state space explosion problem (2012)
  11. Kemper, Stephanie: SAT-based verification for timed component connectors (2012)
  12. Khakpour, Narges; Jalili, Saeed; Talcott, Carolyn; Sirjani, Marjan; Mousavi, Mohammadreza: Formal modeling of evolving self-adaptive systems (2012)
  13. Kleijn, Jetty; Koutny, Maciej; Pietkiewicz-Koutny, Marta: Regions of Petri nets with a/sync connections (2012)
  14. Kokash, Natallia; Krause, Christian; De Vink, Erik: Reo + $\mathrmmCRL2$: a framework for model-checking dataflow in service compositions (2012)
  15. Lumpe, Markus: Partition refinement of component interaction automata (2012)
  16. Meng, Sun; Arbab, Farhad; Aichernig, Bernhard K.; Aştefănoaei, Lăcrămioara; de Boer, Frank S.; Rutten, Jan: Connectors as designs: modeling, refinement and test case generation (2012)
  17. Pourvatan, Bahman; Sirjani, Marjan; Hojjat, Hossein; Arbab, Farhad: Symbolic execution of Reo circuits using constraint automata (2012)
  18. Valero, Valentín; Macià, Hermenegilda; Pardo, Juan José; Cambronero, María Emilia; Díaz, Gregorio: Transforming web services choreographies with priorities and time constraints into prioritized-time colored Petri nets (2012)
  19. Andova, S.; Groenewegen, L.P.J.; de Vink, E.P.: Dynamic consistency in process algebra: from paradigm to ACP (2011)
  20. Bruni, Roberto; Melgratti, Hernán; Montanari, Ugo: A connector algebra for P/T nets interactions (2011)

1 2 3 next

Further publications can be found at: