Reo
From MaRDI portal
Software:18479
No author found.
Related Items (85)
Specification Guidelines to Avoid the State Space Explosion Problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Coordinating mobile agents in interaction spaces ⋮ Unnamed Item ⋮ 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 ⋮ Symbolic model checking for channel-based component connectors ⋮ A basic algebra of stateless connectors ⋮ Combine and conquer: relating BIP and Reo ⋮ From symbolic constraint automata to Promela ⋮ Comparing three coordination models: Reo, ARC, and PBRD ⋮ Modeling dynamic reconfigurations in Reo using high-level replacement systems ⋮ A Normal Form for Stateful Connectors ⋮ Unnamed Item ⋮ A framework for automated distributed implementation of component-based models ⋮ Compositional Specification in Rewriting Logic ⋮ Compositional Semantics of System-Level Designs Written in SystemC ⋮ An Alternative Algorithm for Constraint Automata Product ⋮ 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 ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Associative composition of components with double-sided interfaces ⋮ Unnamed Item ⋮ Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous ⋮ CPO semantics of timed interactive actor networks ⋮ Sampling, Splitting and Merging in Coinductive Stream Calculus ⋮ 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> ⋮ Formal Modeling and Conformance Validation for WS-CDL using Reo and CASM ⋮ On Resource-Sensitive Timed Component Connectors ⋮ Asynchronous stream processing with S-Net ⋮ Modeling component connectors in Reo by constraint automata ⋮ Abstract behavior types: a foundation model for components and their composition ⋮ Regions of Petri nets with a/sync connections ⋮ Causal Semantics for the Algebra of Connectors ⋮ Coordination: Reo, Nets, and Logic ⋮ Proper protocol ⋮ Modeling role-based systems with exogenous coordination ⋮ A note on reactive transitions and Reo connectors ⋮ Formalizing propagation of priorities in Reo, using eight colors ⋮ 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 ⋮ Formal Methods for Components and Objects ⋮ A Connector Algebra for P/T Nets Interactions ⋮ Formal Verification for Components and Connectors ⋮ QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata ⋮ Automata Based Model Checking for Reo Connectors ⋮ A Coordination Model for Interactive Components ⋮ Unnamed Item ⋮ Probabilistic mediator: a coalgebraic perspective ⋮ Connector algebras for C/E and P/T nets' interactions ⋮ 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
This page was built for software: Reo
