Combine and conquer: relating BIP and Reo

DOI10.1016/j.jlamp.2016.09.008zbMath1353.68201OpenAlexW2529998202MaRDI QIDQ347371

Simon Bliudze, Farhad Arbab, Kasper Dokter, Sung-Shik Jongmans

Publication date: 30 November 2016

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2016.09.008

zbMATH Keywords

coordinationBIPcorrectness proofsformal translationsReo

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Data optimizations for constraint automata

Uses Software

• mCRL2
• Reo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparing three coordination models: Reo, ARC, and PBRD
• Algebra of communicating processes with abstraction
• Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions
• Connector colouring. I: Synchronisation and context dependency
• Modeling component connectors in Reo by constraint automata
• Coordination Models Orc and Reo Compared
• Tiles for Reo
• Connector Algebras, Petri Nets, and BIP
• Configuration and dynamic reconfiguration of components using the coordination paradigm
• Reo: a channel-based coordination model for component composition
• An Overview of the mCRL2 Toolset and Its Recent Advances
• Synthesis of Reo Connectors for Strategies and Controllers