Connector Rewriting with High-Level Replacement Systems

DOI10.1016/j.entcs.2008.03.100zbMath1277.68193MaRDI QIDQ2866320

Alexander Lazovik, Christian Köhler, Farhad Arbab

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.100

zbMATH Keywords

coordination; model transformation; service composition; Reo; adhesive categories; high-level replacement systems

Mathematics Subject Classification ID

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

68Q42: Grammars and rewriting systems

Related Items

A Theory Agenda for Component-Based Design, Configuration logics: modeling architecture styles, Synthesis of Reo circuits from scenario-based interaction specifications, Channel-based coordination via constraint satisfaction, Formal modeling of evolving self-adaptive systems, Coordination Models Orc and Reo Compared, Tiles for Reo

Uses Software

• Reo
• Reoservice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural and behavioural compatibility of graphical service specifications
• Coordination models and languages. 9th international conference, COORDINATION 2007, Paphos, Cyprus, June 6--8, 2007. Proceedings
• Connector colouring. I: Synchronisation and context dependency
• Symbolic model checking for channel-based component connectors
• Fundamentals of algebraic graph transformation
• Modeling component connectors in Reo by constraint automata
• Parallelism and concurrency in high-level replacement systems
• Handbook of Graph Grammars and Computing by Graph Transformation
• Reo: a channel-based coordination model for component composition
• Foundations of Software Science and Computation Structures
• Foundations of Software Science and Computation Structures
• Inheritance of behavior