Reo
From MaRDI portal
Software:18479
swMATH6353MaRDI QIDQ18479FDOQ18479
Author name not available (Why is that?)
Cited In (85)
- 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
- An Alternative Algorithm for Constraint Automata Product
- CPO semantics of timed interactive actor networks
- 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
- A connector algebra for P/T nets interactions
- 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>
- Connector rewriting with high-level replacement systems
- Coordination models Orc and Reo compared
- Probabilistic mediator: a coalgebraic perspective
- Modeling dynamic reconfigurations in Reo using high-level replacement systems
- SAT-based verification for timed component connectors
- 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
- A basic logic for reasoning about connector reconfiguration
- Proper protocol
- Decision problems in a logic for reasoning about reconfigurable distributed systems
- Synthesis of Reo circuits from scenario-based specifications
- 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
- Modeling role-based systems with exogenous coordination
- Rigorous development of component-based systems using component metadata and patterns
- Verification of context-dependent channel-based service models
- Abstract behavior types: a foundation model for components and their composition
- Formal modeling and conformance validation for WS-CDL using Reo and CASM
- Connectors as designs
- Automated analysis of Reo circuits using symbolic execution
- 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
- A tutorial on coinductive stream calculus and signal flow graphs
- QoS-driven service selection and composition using quantitative constraint automata
- 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
- Compositional specification in rewriting logic
- A normal form for stateful connectors
- Specification guidelines to avoid the state space explosion problem
- 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
- Protocol scheduling
- A component coordination model based on mobile channels
- 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
- Automata based model checking for Reo connectors
This page was built for software: Reo
