Reo

swMATH6353MaRDI QIDQ18479FDOQ18479

Author name not available (Why is that?)

Described by source

• Reo: a channel-based coordination model for component composition
• Unnamed Publication

Cited In (85)

• Automata Based Model Checking for Reo Connectors
• Title not available (Why is that?)
• Most General Property-Preserving Updates
• Compositional construction of most general controllers
• Soft constraint automata with memory
• A note on reactive transitions and Reo connectors
• Formalizing propagation of priorities in Reo, using eight colors
• A Normal Form for Stateful Connectors
• Specification Guidelines to Avoid the State Space Explosion Problem
• Protocol scheduling
• Coordinating mobile agents in interaction spaces
• Compositional failure-based equivalence of constraint automata
• The \texttt{link}-calculus for open multiparty interactions
• Static and dynamic property-preserving updates
• Data optimizations for constraint automata
• From symbolic constraint automata to Promela
• Formal Verification for Components and Connectors
• A framework for automated distributed implementation of component-based models
• Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions
• Title not available (Why is that?)
• An Alternative Algorithm for Constraint Automata Product
• CPO semantics of timed interactive actor networks
• Synthesis of Reo Circuits from Scenario-based Specifications
• On Resource-Sensitive Timed Component 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
• Formal Methods for Components and Objects
• Channel-based coordination via constraint satisfaction
• Dynamic consistency in process algebra: from paradigm to ACP
• Synthesis of Reo circuits from scenario-based interaction specifications
• Title not available (Why is that?)
• Modeling component connectors in Reo by constraint automata
• Property specifications for workflow modelling
• Interactive verification of architectural design patterns in FACTum
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regions of Petri nets with a/sync connections
• 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>
• Formal Modeling and Conformance Validation for WS-CDL using Reo and CASM
• Connector rewriting with high-level replacement systems
• Coordination models Orc and Reo compared
• Probabilistic mediator: a coalgebraic perspective
• QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata
• Modeling dynamic reconfigurations in Reo using high-level replacement systems
• Connectors as designs: modeling, refinement and test case generation
• SAT-based verification for timed component connectors
• Symbolic execution of Reo circuits using constraint automata
• A model of context-dependent component connectors
• Transforming web services choreographies with priorities and time constraints into prioritized-time colored Petri nets
• Recasting Constraint Automata into Büchi Automata
• Tiles for Reo
• Asynchronous stream processing with S-Net
• Proper protocol
• Decision problems in a logic for reasoning about reconfigurable distributed systems
• A general framework for architecture composability
• Active learning for extended finite state machines
• Connector algebras for C/E and P/T nets' interactions
• A compositional model to reason about end-to-end QoS in stochastic Reo connectors
• Sampling, splitting and merging in coinductive stream calculus
• A basic algebra of stateless connectors
• Partition refinement of component interaction automata
• A Connector Algebra for P/T Nets Interactions
• Modeling role-based systems with exogenous coordination
• Rigorous development of component-based systems using component metadata and patterns
• Abstract behavior types: a foundation model for components and their composition
• Compositional Specification in Rewriting Logic
• A ground-complete axiomatization of stateless bisimilarity over Linda
• Title not available (Why is that?)
• Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous
• Combine and conquer: relating BIP and Reo
• Symbolic model checking for channel-based component connectors
• Comparing three coordination models: Reo, ARC, and PBRD
• A Coordination Model for Interactive Components
• Formal modeling of evolving self-adaptive systems
• Coordination: Reo, Nets, and Logic
• Causal semantics for the algebra of connectors
• Comparing three coordination models: Reo, ARC, and RRD
• Verification of Context-Dependent Channel-Based Service Models
• A tutorial on coinductive stream calculus and signal flow graphs
• Associative composition of components with double-sided interfaces
• Compositional Semantics of System-Level Designs Written in SystemC
• A Theory Agenda for Component-Based Design
• Causal Semantics for the Algebra of Connectors

This page was built for software: Reo