Graph Rewriting Components

被引:0
作者
Heckel, Reiko [1 ]
Corradini, Andrea [2 ]
Gadducci, Fabio [2 ]
机构
[1] Univ Leicester, Leicester, Leics, England
[2] Univ Pisa, Pisa, Italy
来源
GRAPH TRANSFORMATION, ICGT 2022 | 2022年
关键词
Graph transformation; Software components; String diagrams; TRANSFORMATIONS; CONGRUENCES;
D O I
10.1007/978-3-031-09843-7_2
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We introduce a component model for graph rewriting that allows to model a system as a network of components with interfaces representing shared views of internal states and transformations. Their composition assembles a global view whose behaviour is equivalent to the synchronised distributed execution of local components in the network. Formally, components are arrows in a category with interfaces as objects that, with suitable component connectors, forms a Frobenius algebra. This allows the use of string diagrams to model the architecture of basic components and connectors, such that their assembly is freely generated by the algebraic structure. The compositionality of the proposed model is reflected by Structural Operational Semantic rules.
引用
收藏
页码:20 / 37
页数:18
相关论文
共 19 条
[1]  
[Anonymous], 2004, Domain-Driven Design:Tackling Complexity in the Heart of Software
[2]  
Baldan P, 2006, LECT NOTES COMPUT SC, V4178, P153
[3]   AMALGAMATION OF GRAPH-TRANSFORMATIONS - A SYNCHRONIZATION MECHANISM [J].
BOEHM, P ;
FONIO, HR ;
HABEL, A .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1987, 34 (2-3) :377-408
[4]   String Diagram Rewrite Theory I: Rewriting with Frobenius Structure [J].
Bonchi, Filippo ;
Gadducci, Fabio ;
Kissinger, Aleks ;
Sobocinski, Pawel ;
Zanasi, Fabio .
JOURNAL OF THE ACM, 2022, 69 (02)
[5]   Observational congruences for dynamically reconfigurable tile systems [J].
Bruni, R ;
Montanari, U ;
Sassone, V .
THEORETICAL COMPUTER SCIENCE, 2005, 335 (2-3) :331-372
[6]  
Dan H., 2001, LNCS, V2154, P121, DOI [10.1007/3-540-44685-09, DOI 10.1007/3-540-44685-09]
[7]  
Ehrig H., 1990, EATCS MONOGRAPHS THE, V21, DOI [10.1007/978-3-642-61284-8, DOI 10.1007/978-3-642-61284-8]
[8]   Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts [J].
Ehrig, Hartmut ;
Konig, Barbara .
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2006, 16 (06) :1133-1163
[9]  
Engels G, 2005, LECT NOTES COMPUT SC, V3393, P38
[10]  
Ferrari GL, 2006, LECT NOTES COMPUT SC, V4111, P22