A specification language for Reo connectors
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(13)- Learning to coordinate
- From symbolic constraint automata to Promela
- Modeling component connectors in Reo by constraint automata
- Connector rewriting with high-level replacement systems
- Intentional automata: a context-dependent model for component connectors (extended abstract)
- Connectors as designs
- Automata based model checking for Reo connectors
- A model of context-dependent component connectors
- Overview of thirty semantic formalisms for Reo
- Reo: a channel-based coordination model for component composition
- Synthesis of Reo circuits from scenario-based specifications
- Quantitative Kleene coalgebras
- A coinductive calculus of component connectors.
This page was built for publication: A specification language for Reo connectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894576)