Berthold Hoffmann
YOU?
Author Swipe
View article: Finite Automata for Efficient Graph Recognition
Finite Automata for Efficient Graph Recognition Open
Engelfriet and Vereijken have shown that linear graph grammars based on hyperedge replacement generate graph languages that can be considered as interpretations of regular string languages over typed symbols. In this paper we show that fin…
View article: Finite Automata for Efficient Graph Recognition
Finite Automata for Efficient Graph Recognition Open
Engelfriet and Vereijken have shown that linear graph grammars based on hyperedge replacement generate graph languages that can be considered as interpretations of regular string languages over typed symbols. In this paper we show that fin…
View article: Graph Rewriting with Contextual Refinement
Graph Rewriting with Contextual Refinement Open
In the standard theory of graph transformation, a rule modifies only subgraphs of constant size and fixed shape. The rules supported by the graph-rewriting tool GrGen are far more expressive: they may modify subgraphs of unbounded size and…
View article: Defining Models - Meta Models versus Graph Grammars
Defining Models - Meta Models versus Graph Grammars Open
The precise specification of software models is a major concern in model-driven design of object-oriented software. Metamodelling and graph grammars are apparent choices for such specifications. Metamodelling has several advantages: it is …
View article: Conditional Adaptive Star Grammars
Conditional Adaptive Star Grammars Open
The precise specification of software models is a major concern in the model-driven design of object-oriented software. Models are commonly given as graph-like diagrams so that graph grammars are a natural candidate for specifying them. Ho…
View article: Proceedings Twelfth International Workshop on Graph Computational Models
Proceedings Twelfth International Workshop on Graph Computational Models Open
This volume contains the post-proceedings of the Twelfth International Workshop on Graph Computation Models (GCM 2021). The workshop was part of STAF 2021 (Software Technologies: Applications and Foundations) as an online-workshop on 22nd …
View article: Proceedings of the Eleventh International Workshop on Graph Computation\n Models
Proceedings of the Eleventh International Workshop on Graph Computation\n Models Open
Graphs are common mathematical structures that are visual and intuitive. They\nconstitute a natural and seamless way for system modelling in science,\nengineering and beyond, including computer science, biology, business process\nmodelling…