Advertisement

Definitions and comparisons of local computations on graphs

Extended abstract
  • Igor Litovsky
  • Yves Métivier
  • Eric Sopena
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)

Abstract

We are interested in models to encode and to prove decentralized and distributed computations on graphs or networks. In this paper, we define and compare six models of graph rewriting systems. These systems do not change the underlying structure of the graph on which they work, but only the labelling of its components (edges or vertices). Each rewriting step is fully determinated by the knowledge of a fixed size subgraph, the local context of the rewritten occurrence. The studied families are based on the rewriting of partial or induced subgraphs and we use two kinds of mechanisms to locally control the applicability of rules: a priority relation on the set of rules or a set of forbidden contexts associated with each rule. We show that these two basic (i.e. without local control) families of graph rewriting systems are distinct, but whenever we consider the local controls of the rewriting, the four so-obtained families are equivalent.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Angluin, Local and global properties in networks of processors, Proceedings of the 12th Symposium on Theory of Computing (1980), 82–93.Google Scholar
  2. [2]
    M. Billaud, P. Lafon, Y. Métivier and E. Sopena, Graph Rewriting Systems with Priorities, Lecture Notes in Computer Science 411 (1989), 94–106.Google Scholar
  3. [3]
    B. Courcelle, Recognizable sets of unrooted trees in Definability and Recognizability of sets of trees, Elsevier, to appear (1991).Google Scholar
  4. [4]
    I. Litovsky and Y. Métivier, Computing with Graph Rewriting Systems with Priorities, Fourth International Worshop on Graph Grammars and their Applications to Computer Science, Bremen. Lecture Notes in Computer Science 532 (1991), 549–563.MATHCrossRefGoogle Scholar
  5. [5]
    I. Litovsky and Y. Métivier, Computing trees with graph rewriting systems with priorities, in Definability and Recognizability of sets of trees, Elsevier, to appear (1991).Google Scholar
  6. [6]
    I. Litovsky, Y. Métivier, E. Sopena, Definitions and comparisons of local computations on graphs, Internal Report No 91-43, LaBRI, Université Bordeaux I (1991).Google Scholar
  7. [7]
    I. Litovsky, Y. Métivier and W. Zielonka The power and limitations of local computations on graphs and networks, Internal Report No 91-31, LaBRI, Université Bordeaux I, submitted to publication (1991).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Igor Litovsky
    • 1
  • Yves Métivier
    • 1
  • Eric Sopena
    • 1
  1. 1.Laboratoire Bordelais de Recherche en InformatiqueUnité associée C.N.R.S. 1304Talence

Personalised recommendations