Dynamic graph transformation systems

被引：0
|
作者：
Bruni, Roberto [1 ]
Melgratti, Hernan [1 ]
机构：
[1] Univ Pisa, Dept Comp Sci, Pisa, Italy
来源：
GRAPH TRANSFORMATIONS, PROCEEDINGS | 2006年 / 4178卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We introduce an extension of Graph Grammars (GGs), called Dynan tic Graph Grammars (DynGGs), where the right-hand side of a production can spawn fresh parts of the type graph and fresh productions operating on it. The features of DynGGs make them suitable for the straightforward modeling of reflexive mobile systems like dynamic nets and the Join calculus. Our main result shows that each DynGG can be modeled as a (finite) GG, so that the dynamically generated structure can be typed statically, still preserving exactly all derivations.
引用
下载
收藏
页码：230 / 244
页数：15
相关论文
共 50 条
  • [41] Concepts for specifying complex graph transformation systems
    RWTH Aachen University, Department of Computer Science III, Ahornstrasse 55, Aachen
    52074, Germany
    Comune di Roma; European Association for Theoretical Computer Science (EATCS); European Association of Software Science and Technology (EASST); Foundations of Systems Specification; IFIP, Working Group 1.3; Universita di Roma La Sapienza, 1600, 96-111 (2004):
  • [42] GRAPH GRAMMARS - A FORMAL METHOD FOR DYNAMIC STRUCTURE TRANSFORMATION
    Helms, Bergen
    Eben, Katharina
    Shea, Kristina
    Lindemann, Udo
    PROCEEDINGS OF THE 11TH INTERNATIONAL DSM CONFERENCE, 2009, : 93 - 96
  • [43] Compositional verification of reactive systems specified by graph transformation
    Heckel, R
    FUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING, 1998, 1382 : 138 - 153
  • [44] Compositional Analysis of Probabilistic Timed Graph Transformation Systems
    Maximova, Maria
    Schneider, Sven
    Giese, Holger
    FORMAL ASPECTS OF COMPUTING, 2023, 35 (03)
  • [45] Resilience of Well-structured Graph Transformation Systems
    Oezkan, Okan
    Wuerdemann, Nick
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2021, (350): : 69 - 88
  • [46] GTS Families for the Flexible Composition of Graph Transformation Systems
    Zschaler, Steffen
    Duran, Francisco
    FUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING, FASE 2017, 2017, 10202 : 208 - 225
  • [47] Unfolding graph transformation systems:: Theory and applications to verification
    Baldan, Paolo
    Corradini, Andrea
    Koenig, Barbara
    CONCURRENCY, GRAPHS AND MODELS: ESSAYS DEDICATED TO UGO MONTANARI ON THE OCCASION OF HIS 65TH BIRTHDAY, 2008, 5065 : 16 - +
  • [48] Verifying specifications with associated attributes in graph transformation systems
    Yu Zhou
    Yankai Huang
    Ou Wei
    Zhiqiu Huang
    Frontiers of Computer Science, 2015, 9 : 364 - 374
  • [49] Modeling and Verification of Reliable Messaging by Graph Transformation Systems
    Goenczy, Laszlo
    Kovacs, Matc
    Varro, Daniel
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 175 (04) : 37 - 50
  • [50] AUGUR-A TOOL FOR THE ANALYSIS OF GRAPH TRANSFORMATION SYSTEMS
    Ehrig, Hartmut
    Koenig, Barbara
    Kozioura, Vitali
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (87): : 126 - 137
12345