Pages that link to "Item:Q4819114"

The following pages link to Reo: a channel-based coordination model for component composition (Q4819114):

Displaying 50 items.

• Reo (Q18479) (← links)
• Rigorous development of component-based systems using component metadata and patterns (Q333322) (← links)
• Combine and conquer: relating BIP and Reo (Q347371) (← links)
• SAT-based verification for timed component connectors (Q433331) (← links)
• Connectors as designs: modeling, refinement and test case generation (Q433336) (← links)
• Symbolic execution of Reo circuits using constraint automata (Q433344) (← links)
• Transforming web services choreographies with priorities and time constraints into prioritized-time colored Petri nets (Q436361) (← links)
• A model of context-dependent component connectors (Q436387) (← links)
• A ground-complete axiomatization of stateless bisimilarity over Linda (Q477631) (← links)
• Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous (Q516036) (← links)
• Synthesis of Reo circuits from scenario-based interaction specifications (Q541679) (← links)
• Channel-based coordination via constraint satisfaction (Q541681) (← links)
• Dynamic consistency in process algebra: from paradigm to ACP (Q541685) (← links)
• Property specifications for workflow modelling (Q549695) (← links)
• Comparing three coordination models: Reo, ARC, and PBRD (Q608351) (← links)
• Modeling dynamic reconfigurations in Reo using high-level replacement systems (Q608354) (← links)
• Regions of Petri nets with a/sync connections (Q714824) (← links)
• A general framework for architecture composability (Q736458) (← links)
• Active learning for extended finite state machines (Q736459) (← links)
• A basic algebra of stateless connectors (Q860881) (← links)
• Alternating-time stream logic for multi-agent systems (Q967523) (← links)
• Formalization of an architectural model for exception handling coordination based on CA action concepts (Q967556) (← links)
• Consistent integration of models based on views of meta models (Q973049) (← links)
• A compositional model to reason about end-to-end QoS in stochastic Reo connectors (Q1651010) (← links)
• Associative composition of components with double-sided interfaces (Q1733102) (← links)
• A framework for automated distributed implementation of component-based models (Q1938379) (← links)
• Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions (Q1941851) (← links)
• Formal modeling of evolving self-adaptive systems (Q1951611) (← links)
• Partition refinement of component interaction automata (Q1951613) (← links)
• Static and dynamic property-preserving updates (Q2042718) (← links)
• Probabilistic mediator: a coalgebraic perspective (Q2079684) (← links)
• Decision problems in a logic for reasoning about reconfigurable distributed systems (Q2104556) (← links)
• Protocol scheduling (Q2145259) (← links)
• The \texttt{link}-calculus for open multiparty interactions (Q2216110) (← links)
• Asynchronous stream processing with S-Net (Q2269910) (← links)
• Interactive verification of architectural design patterns in FACTum (Q2335950) (← links)
• Compositional construction of most general controllers (Q2350495) (← links)
• A perspective on service orchestration (Q2389337) (← links)
• Symbolic model checking for channel-based component connectors (Q2389338) (← links)
• A tutorial on coinductive stream calculus and signal flow graphs (Q2571208) (← links)
• Compositional Failure-based Equivalence of Constraint Automata (Q2810975) (← links)
• A modular formal semantics for Ptolemy (Q2843863) (← links)
• Comparing Three Coordination Models: Reo, ARC, and RRD (Q2866318) (← links)
• Coordination Models Orc and Reo Compared (Q2866319) (← links)
• Connector Rewriting with High-Level Replacement Systems (Q2866320) (← links)
• A Normal Form for Stateful Connectors (Q2945707) (← links)
• Data optimizations for constraint automata (Q2974782) (← links)
• Traces for coalgebraic components (Q3005989) (← links)
• Failure-based equivalence of constraint automata (Q3056378) (← links)
• Verification of Context-Dependent Channel-Based Service Models (Q3066118) (← links)