Linear-Ordered Graph Grammars: Applications to Distributed Systems Design

Authors:
Leila Ribeiro;Fernando Luís Dotti
Affiliations:
Instituto de Informática, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil;Faculdade de Informática, Pontifícia Universidade Católica do Rio Grande do Sul, Porto Alegre, Brazil
Venue:
Concurrency, Graphs and Models
Year:
2008

Citing 13
Cited 0

Algebraic approach to single-pushout graph transformation

Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Graph processes

Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Algebraic approaches to graph transformation. Part II: single pushout approach and comparison with double pushout approach

Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution

Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Tile formats for located and mobile systems

Information and Computation - Special issue on EXPRESS 1997
The tile model

Proof, language, and interaction
Dynamic connectors for concurrency

Theoretical Computer Science
Comparing logics for rewriting: rewriting logic, action calculi and tile logic

Theoretical Computer Science - Rewriting logic and its applications
Mapping tile logic into rewriting logic

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Introduction to the Algebraic Theory of Graph Grammars (A Survey)

Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Linear Ordered Graph Grammars and Their Algebraic Foundations

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Verifying fault-tolerant distributed systems using object-based graph grammars

LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear-ordered graph grammars (LOGGs) are a special kind of graph grammars that were inspired by the general definitions of graph grammars and by tile systems. In this paper we show that this kind of grammar is particularly suited for the specification of distributed systems. Moreover, we discuss a simple extension of LOGGs inspired by the representation using tiles, leading to a notion of open graphs that can be very useful in a wider range of applications.