Reo: a channel-based coordination model for component composition
From MaRDI portal
Recommendations
- A coinductive calculus of component connectors.
- A specification language for Reo connectors
- 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>
- Modeling component connectors in Reo by constraint automata
- scientific article; zbMATH DE number 2087388
Cited in
(98)- A relational model for probabilistic connectors based on timed data distribution streams
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors
- Associative composition of components with double-sided interfaces
- Abstract behavior types: a foundation model for components and their composition
- Reo
- A framework for automated distributed implementation of component-based models
- Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions
- Formal modeling of evolving self-adaptive systems
- Partition refinement of component interaction automata
- Modeling role-based systems with exogenous coordination
- Formalizing propagation of priorities in Reo, using eight colors
- Learning to coordinate
- Reo connectors and components as tagged signal models
- Static and dynamic property-preserving updates
- Probabilistic mediator: a coalgebraic perspective
- Decision problems in a logic for reasoning about reconfigurable distributed systems
- Protocol scheduling
- The \texttt{link}-calculus for open multiparty interactions
- Asynchronous stream processing with S-Net
- Interactive verification of architectural design patterns in FACTum
- Compositional construction of most general controllers
- Connector colouring. I: Synchronisation and context dependency
- A perspective on service orchestration
- Symbolic model checking for channel-based component connectors
- Modeling component connectors in Reo by constraint automata
- A tutorial on coinductive stream calculus and signal flow graphs
- Compositional failure-based equivalence of constraint automata
- A modular formal semantics for Ptolemy
- Comparing three coordination models: Reo, ARC, and RRD
- Coordination models Orc and Reo compared
- Connector rewriting with high-level replacement systems
- A specification language for Reo connectors
- A normal form for stateful connectors
- Data optimizations for constraint automata
- Connectors as designs
- Traces for coalgebraic components
- Failure-based equivalence of constraint automata
- Verification of context-dependent channel-based service models
- A connector algebra for P/T nets interactions
- Tiles for Reo
- Rigorous development of component-based systems using component metadata and patterns
- Automata based model checking for Reo connectors
- A component coordination model based on mobile channels
- Combine and conquer: relating BIP and Reo
- Causal Semantics for the Algebra of Connectors
- Coordination: Reo, Nets, and Logic
- Formal Verification for Components and Connectors
- 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
- scientific article; zbMATH DE number 2084609 (Why is no real title available?)
- Overview of thirty semantic formalisms for Reo
- scientific article; zbMATH DE number 2087388 (Why is no real title available?)
- A ground-complete axiomatization of stateless bisimilarity over Linda
- Composition of interacting computations
- Time-fluid field-based coordination through programmable distributed schedulers
- A logical framework to reason about Reo circuits
- Capturing stochastic and real-time behavior in Reo connectors
- Compositional specification in rewriting logic
- Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous
- 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
- Relating BIP and Reo
- A Theory Agenda for Component-Based Design
- Synthesis of Reo circuits from scenario-based interaction specifications
- Channel-based coordination via constraint satisfaction
- Dynamic consistency in process algebra: from paradigm to ACP
- On Resource-Sensitive Timed Component Connectors
- A basic logic for reasoning about connector reconfiguration
- Property specifications for workflow modelling
- Recasting Constraint Automata into Büchi Automata
- Most General Property-Preserving Updates
- A coinductive calculus of component connectors.
- Soft constraint automata with memory
- Causal semantics for the algebra of connectors
- Specification and verification of concurrent systems by causality and realizability
- Comparing three coordination models: Reo, ARC, and PBRD
- Modeling dynamic reconfigurations in Reo using high-level replacement systems
- A formal algebraic approach for the quantitative modeling of connectors in architectures
- ReLo: a Dynamic Logic to Reason About Reo Circuits
- Using PVS for Modeling and Verification of Probabilistic Connectors
- APML: an architecture proof modeling language
- An autonomous data language
- The autonomous data language -- concepts, design and formal verification
- Regions of Petri nets with a/sync connections
- Safe orchestrated multicomposition of systems of communicating finite state machines
- Compositional separation of control flow and data flow
- A Theory of Architectural Design Patterns
- A general framework for architecture composability
- Active learning for extended finite state machines
- A basic algebra of stateless connectors
- Alternating-time stream logic for multi-agent systems
- Formalization of an architectural model for exception handling coordination based on CA action concepts
- Consistent integration of models based on views of meta models
This page was built for publication: Reo: a channel-based coordination model for component composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819114)
