Reo: a channel-based coordination model for component composition
From MaRDI portal
Publication:4819114
DOI10.1017/S0960129504004153zbMath1085.68552MaRDI QIDQ4819114
Publication date: 24 September 2004
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Related Items
Protocol scheduling ⋮ Tiles for Reo ⋮ Rigorous development of component-based systems using component metadata and patterns ⋮ A compositional model to reason about end-to-end QoS in stochastic Reo connectors ⋮ A perspective on service orchestration ⋮ Symbolic model checking for channel-based component connectors ⋮ A basic algebra of stateless connectors ⋮ Combine and conquer: relating BIP and Reo ⋮ Comparing three coordination models: Reo, ARC, and PBRD ⋮ Modeling dynamic reconfigurations in Reo using high-level replacement systems ⋮ A Normal Form for Stateful Connectors ⋮ Specification and verification of concurrent systems by causality and realizability ⋮ A framework for automated distributed implementation of component-based models ⋮ A formal algebraic approach for the quantitative modeling of connectors in architectures ⋮ Compositional Specification in Rewriting Logic ⋮ ReLo: a Dynamic Logic to Reason About Reo Circuits ⋮ Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions ⋮ SAT-based verification for timed component connectors ⋮ Connectors as designs: modeling, refinement and test case generation ⋮ Symbolic execution of Reo circuits using constraint automata ⋮ Transforming web services choreographies with priorities and time constraints into prioritized-time colored Petri nets ⋮ A model of context-dependent component connectors ⋮ Formal modeling of evolving self-adaptive systems ⋮ Partition refinement of component interaction automata ⋮ Data optimizations for constraint automata ⋮ The \texttt{link}-calculus for open multiparty interactions ⋮ Unnamed Item ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Associative composition of components with double-sided interfaces ⋮ Traces for coalgebraic components ⋮ Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous ⋮ Alternating-time stream logic for multi-agent systems ⋮ Formalization of an architectural model for exception handling coordination based on CA action concepts ⋮ Most General Property-Preserving Updates ⋮ Synthesis of Reo circuits from scenario-based interaction specifications ⋮ Channel-based coordination via constraint satisfaction ⋮ Dynamic consistency in process algebra: from paradigm to ACP ⋮ Consistent integration of models based on views of meta models ⋮ Property specifications for workflow modelling ⋮ Synthesis of Reo Circuits from Scenario-based Specifications ⋮ Deconstructing <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="script">R</mml:mi><mml:mi mathvariant="sans-serif">eo</mml:mi></mml:math> ⋮ Coordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints ⋮ Formal Modeling and Conformance Validation for WS-CDL using Reo and CASM ⋮ On Resource-Sensitive Timed Component Connectors ⋮ Asynchronous stream processing with S-Net ⋮ Regions of Petri nets with a/sync connections ⋮ Failure-based equivalence of constraint automata ⋮ Causal Semantics for the Algebra of Connectors ⋮ Coordination: Reo, Nets, and Logic ⋮ Verification of Context-Dependent Channel-Based Service Models ⋮ Causal semantics for the algebra of connectors ⋮ Soft constraint automata with memory ⋮ A general framework for architecture composability ⋮ Active learning for extended finite state machines ⋮ Static and dynamic property-preserving updates ⋮ Compositional Failure-based Equivalence of Constraint Automata ⋮ A Connector Algebra for P/T Nets Interactions ⋮ Reo ⋮ Formal Verification for Components and Connectors ⋮ Probabilistic mediator: a coalgebraic perspective ⋮ A modular formal semantics for Ptolemy ⋮ Recasting Constraint Automata into Büchi Automata ⋮ A tutorial on coinductive stream calculus and signal flow graphs ⋮ Interactive verification of architectural design patterns in FACTum ⋮ A Theory Agenda for Component-Based Design ⋮ Comparing Three Coordination Models: Reo, ARC, and RRD ⋮ Coordination Models Orc and Reo Compared ⋮ Connector Rewriting with High-Level Replacement Systems ⋮ Decision problems in a logic for reasoning about reconfigurable distributed systems ⋮ Compositional construction of most general controllers
Uses Software
