Sciweavers

21 search results - page 4 / 5
» Hyperedge Replacement, Graph Grammars
Sort
View
TAGT
1998
Springer
162views Graph Theory» more  TAGT 1998»
15 years 2 months ago
Hypergraphs as a Uniform Diagram Representation Model
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concep...
Mark Minas
ENTCS
2006
125views more  ENTCS 2006»
14 years 10 months ago
Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility
We compare the expressive power of Hoare (i.e., CSP style) and Milner (i.e., CCS style) synchronizations for defining graph transformations in a framework where edges can perform ...
Ivan Lanese, Ugo Montanari
AGTIVE
2003
Springer
15 years 3 months ago
Modeling Discontinuous Constituents with Hypergraph Grammars
Discontinuous constituent are a frequent problem in natural language analyses. A constituent is called discontinuous if it is interrupted by other constituents. In German they can ...
Ingrid Fischer
DAC
1994
ACM
15 years 2 months ago
Design Methodology Management Using Graph Grammars
In this paper, we present a design methodology management system, which assists designers in selecting a suitable design process and invoking the selected sequence of tools on the...
Reid A. Baldwin, Moon-Jung Chung
GG
2004
Springer
15 years 3 months ago
Constraints and Application Conditions: From Graphs to High-Level Structures
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl...