A specification language for Reo connectors
DOI10.1007/978-3-642-29320-7_26zbMATH Open1353.68056OpenAlexW1542044052MaRDI QIDQ2894576FDOQ2894576
Authors: Alexandra Silva 
Publication date: 29 June 2012
Published in: Fundamentals of Software Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29320-7_26
Recommendations
Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (13)
- Quantitative Kleene coalgebras
- Modeling component connectors in Reo by constraint automata
- Connector rewriting with high-level replacement systems
- A model of context-dependent component connectors
- Learning to coordinate
- Synthesis of Reo circuits from scenario-based specifications
- Reo: a channel-based coordination model for component composition
- A coinductive calculus of component connectors.
- Connectors as designs
- From symbolic constraint automata to Promela
- Automata based model checking for Reo connectors
- Intentional automata: a context-dependent model for component connectors (extended abstract)
- Overview of thirty semantic formalisms for Reo
Uses Software
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)
