Tiles for Reo

DOI10.1007/978-3-642-03429-9_4zbMath1253.68090OpenAlexW2140272810MaRDI QIDQ3184723

Ugo Montanari, Dave Clarke, Farhad Arbab, Ivan Lanese, Roberto Bruni

Publication date: 22 October 2009

Published in: Recent Trends in Algebraic Development Techniques (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/243998

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (7)

Combine and conquer: relating BIP and Reo ⋮ A Normal Form for Stateful Connectors ⋮ A model of context-dependent component connectors ⋮ Behaviour, Interaction and Dynamics ⋮ From Hierarchical BIP to Petri Calculus ⋮ Channel-based coordination via constraint satisfaction ⋮ A Connector Algebra for P/T Nets Interactions

Uses Software

• Reo

Cites Work

• Unnamed Item
• Unnamed Item
• A basic algebra of stateless connectors
• Conditional rewriting logic as a unified model of concurrency
• An algebraic semantics for structured transition systems and its application to logic programs
• The origins of structural operational semantics
• Graph rewriting, constraint solving and tiles for coordinating distributed systems
• Connector colouring. I: Synchronisation and context dependency
• Modeling component connectors in Reo by constraint automata
• Connector Rewriting with High-Level Replacement Systems
• Reo: a channel-based coordination model for component composition
• Recent Trends in Algebraic Development Techniques

This page was built for publication: Tiles for Reo