Abstract
We are interested in models to encode and to prove decentralized and distributed computations on graphs. In this paper we define and compare six models of graph relabeling systems. These systems do not change the underlying structure of the graph on which they work, but only the labeling of its components (edges or vertices). Each relabeling step is fully determined by the knowledge of a fixed-size subgraph, the local context of the relabeled occurrence. The families studied are based on the relabeling of partial or induced subgraphs and we use two kinds of mechanisms to control the applicability of rules locally: 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 relabeling systems are distinct, but whenever we consider the local controls of the relabeling, the four families so obtained are equivalent.
Similar content being viewed by others
References
M. W. Alford, J. P. Ansart, G. Hommel, L. Lamport, B. Kiskov, G. P. Mullery, and F. B. Schneider,Distributed Systems, Lecture Notes in Computer Science, Vol. 190, Springer-Verlag, Berlin, 1985.
D. Angluin, Local and global properties in networks of processors,Proceedings of the 12th Symposium on The Theory of Computing, 1980, pp. 82–93.
C. Berge,Graphs and Hypergraphs, North-Holland, Amsterdam, 1977.
M. Billaud, P. Lafon, Y. Métivier, and E. Sopena,Graph Rewriting Systems with Priorities, Lecture Notes in Computer Science, Vol. 411, Springer-Verlag, Berlin, 1989, pp. 94–106.
B. Courcelle, Recognizable sets of unrooted trees, inTree Automata and Languages, M. Nivat and A. Podelski (editors), Elsevier, Amsterdam, 1992, pp. 141–157.
J. Dassow and G. Paun,Regulated Rewriting in Formal Language Theory, EATCS Series, Vol. 18, 1989.
A. Gibbons,Algorithmic Graph Theory, Cambridge University Press, Cambridge, 1985.
F. T. Leighton, Finite common coverings of graphs,J. Combin. Theory Ser. B,33 (1982), 231–238.
I. Litovsky and Y. Métivier, Computing with graph rewriting systems with priorities,Proceedings of the Fourth International Workshop on Graph Grammars and Their Applications to Computer Science, Bremen, Lecture Notes in Computer Science, Vol. 532, Springer-Verlag, Berlin, 1991, pp. 549–563.
I. Litovsky and Y. Métivier, Computing trees with graph rewriting systems with priorities, inTree Automata and Languages, M. Nivat and A. Podelski (editors), Elsevier, Amsterdam, 1992, pp. 115–139.
I. Litovsky, Y. Métivier, and W. Zielonka, The power and limitations of local computations on graphs and networks,Proceedings of Graph-Theoretic Concepts in Computer Science (WG '92), Lecture Note in Computer Science, Vol. 657, Springer-Verlag, Berlin, 1993, pp. 333–345.
A. Mazurkiewicz, Elections in planar graphs, Internal Report 190-105, University of Bordeaux, 1990.
Author information
Authors and Affiliations
Additional information
This research was supported by the PRC Mathématiques et Informatique, the European Basic Research Action ESPRIT No. 3166 ASMICS, and the ESPRIT-Basic Research Working Group “COMPUGRAPH II.”
Rights and permissions
About this article
Cite this article
Litovsky, I., Métivier, Y. & Sopena, E. Different local controls for graph relabeling systems. Math. Systems Theory 28, 41–65 (1995). https://doi.org/10.1007/BF01294595
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01294595