Hierarchically Distributed Graph Transformation
نویسنده
چکیده
Hierarchically distributed graph transformation ooers means to model diierent aspects of open distributed systems very intuitively in a graphical way. The distribution topology as well as local object structures are represented graphically. Distributed actions such as local actions, network activities, communication and synchronization can be described homogeneously using the same method: graph transformation. This new approach to graph transformation follows the lines of algebraic and categorical graph grammars and ts into the framework of double-pushout high-level replacement systems.
منابع مشابه
Distributed Graphs and Graph Transformation
The new approach of distributed graphs and graph transformation as developed in this article allows to use structured graph transformation on two abstraction levels, the network and the local level. The network level contains the description of the topological structures of a system. The local level covers the description of states and their transitions in local systems. Local state transitions...
متن کاملHRNCE Grammars - A Hypergraph Generating System with an eNCE Way
Software Integration Problems and Coupling of Graph Grammar Specifications p. 155 Using Attributed Flow Graph Parsing to Recognize Cliches in Programs p. 170 Reconfiguration Graph Grammar for Massively Parallel, Fault Tolerant Computers p. 185 The Use of Tree Transducers to Compute Translations Between Graph Algebras p. 196 The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars p. 2...
متن کاملHierarchical Graph Transformation
When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible. In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. Our framework extends the well-known double-pushout approach from fla...
متن کاملDistributed Fault Localization in Hierarchically Routed Networks
Probabilistic inference was shown effective in non-deterministic diagnosis of end-to-end service failures. To overcome the exponential complexity of the exact inference algorithms in fault propagation models represented by graphs with undirected loops, Pearl’s iterative algorithms for polytrees were used as an approximation schema. The approximation made it possible to diagnose end-to-end servi...
متن کاملModeling Agent Systems with Distributed Transformation Units
Agent systems have become more and more important in computer science. They allow to implement complex distributed systems composed of communicating autonomous entities. Transformation units constitute a structuring principle for graph transformation systems which split up large sets of rules, but still graphs are transformed as a whole. Recently, distributed transformation units have been intr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994