Reo
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Compositional specification in rewriting logic
- A framework for automated distributed implementation of component-based models
- Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions
- Formal Verification for Components and Connectors
- CPO semantics of timed interactive actor networks
- An Alternative Algorithm for Constraint Automata Product
- 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
- Channel-based coordination via constraint satisfaction
- Dynamic consistency in process algebra: from paradigm to ACP
- Synthesis of Reo circuits from scenario-based interaction specifications
- On Resource-Sensitive Timed Component Connectors
- A normal form for stateful connectors
- Formal Methods for Components and Objects
- Specification guidelines to avoid the state space explosion problem
- scientific article; zbMATH DE number 5519816 (Why is no real title available?)
- 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
- Most General Property-Preserving Updates
- Regions of Petri nets with a/sync connections
- Probabilistic mediator: a coalgebraic perspective
- Connector rewriting with high-level replacement systems
- Coordination models Orc and Reo compared
- Modeling dynamic reconfigurations in Reo using high-level replacement systems
- 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>
- 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
- Compositional construction of most general controllers
- SAT-based verification for timed component connectors
- Tiles for Reo
- Recasting Constraint Automata into Büchi Automata
- Asynchronous stream processing with S-Net
- Soft constraint automata with memory
- Proper protocol
- A note on reactive transitions and Reo connectors
- Formalizing propagation of priorities in Reo, using eight colors
- Decision problems in a logic for reasoning about reconfigurable distributed systems
- A basic logic for reasoning about connector reconfiguration
- A general framework for architecture composability
- Active learning for extended finite state machines
- Synthesis of Reo circuits from scenario-based specifications
- Protocol scheduling
- Connector algebras for C/E and P/T nets' interactions
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors
- D-Finder
- rbminer
- SCADE
- simpA
- Lutess
- Rapide
- mCRL2
- rCOS
- ArchJava
- TIMES
- Design/CPN
- MANIFOLD
- POOL
- YAWL
- HOL-OCL
- PICCOLA
- 2APL
- BPEL2oWFN
- Woflan
- Ptolemy
- PAGODA
- Reoservice
- LUSTRE
- M-nets
- KLAIM
- LIME
- Linda
- Genet
- Viptos
- FDR2
- CArtAgO
- Sisal
- UNITY
- VipTool
- SOFA 2.0
- Metropolis
- RALib
- AIOCJ
- Xtext
- OP2
- PACC starter kit
- DLC
- Esterel
- LNT2LOTOS
- Lucid
- Sigma*
- XTL
- Legion
- Dynamic Architectures
- FACTum
This page was built for software: Reo
