Automata based model checking for Reo connectors

DOI10.1007/978-3-642-11623-0_15MaRDI QIDQ3400925zbMATH OpenOpenAlexFDO

Authors Marcello M. Bonsangue, Mohammad Izadi

Publication date 28 January 2010

Published in Fundamentals of Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11623-0_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Modeling component connectors in Reo by constraint automata
• A specification language for Reo connectors
• Reo: a channel-based coordination model for component composition
• Compositional failure-based equivalence of constraint automata
• A coinductive calculus of component connectors.

Cited in

(12)

• Synthesis of Reo connectors for strategies and controllers
• Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions
• Modeling component connectors in Reo by constraint automata
• A specification language for Reo connectors
• Recasting Constraint Automata into Büchi Automata
• A note on reactive transitions and Reo connectors
• Reo connectors and components as tagged signal models
• Compositional failure-based equivalence of constraint automata
• Verification of context-dependent channel-based service models
• Automated analysis of Reo circuits using symbolic execution
• Symbolic model checking for channel-based component connectors
• ReLo: a Dynamic Logic to Reason About Reo Circuits

Describes a project that uses

Uses Software

• Reo

This page was built for publication: Automata based model checking for Reo connectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400925)