Modeling component connectors in Reo by constraint automata
From MaRDI portal
Publication:2495551
DOI10.1016/j.scico.2005.10.008zbMath1105.68058OpenAlexW1988680012MaRDI QIDQ2495551
Christel Baier, Farhad Arbab, Marjan Sirjani, Jan J. M. M. Rutten
Publication date: 30 June 2006
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/14373
verificationsimulationcompositionbisimulationcomponentscoordinationReoconstraint automatatimed data streams
Related Items
Tiles for Reo ⋮ A compositional model to reason about end-to-end QoS in stochastic Reo connectors ⋮ A perspective on service orchestration ⋮ Symbolic model checking for channel-based component 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 ⋮ ReLo: a Dynamic Logic to Reason About Reo Circuits ⋮ 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 ⋮ A model of context-dependent component connectors ⋮ Data optimizations for constraint automata ⋮ Traces for coalgebraic components ⋮ Alternating-time stream logic for multi-agent systems ⋮ Most General Property-Preserving Updates ⋮ Synthesis of Reo circuits from scenario-based interaction specifications ⋮ Channel-based coordination via constraint satisfaction ⋮ 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 ⋮ Failure-based equivalence of constraint automata ⋮ Coordination: Reo, Nets, and Logic ⋮ Verification of Context-Dependent Channel-Based Service Models ⋮ Soft constraint automata with memory ⋮ A formal approach to the engineering of domain-specific distributed systems ⋮ Static and dynamic property-preserving updates ⋮ Compositional Failure-based Equivalence of Constraint Automata ⋮ Linear Temporal Logic of Constraint Automata ⋮ Formal Verification for Components and Connectors ⋮ Recasting Constraint Automata into Büchi Automata ⋮ Interactive verification of architectural design patterns in FACTum ⋮ Comparing Three Coordination Models: Reo, ARC, and RRD ⋮ Coordination Models Orc and Reo Compared ⋮ Connector Rewriting with High-Level Replacement Systems ⋮ Compositional construction of most general controllers
Uses Software
