Abstract
In this paper, we develop a new theory of attribute graph rewriting systems with priorities. This theory provides a very general tool for describing algorithms from classical graph theory, and for algorithms implemented on networks of communicating processors and distributed systems. Moreover, this theory gives an algebraic model which allows us to mathematically prove properties of distributed algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.O., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
Baeten, J.C.M., Bergstra, J.A., Klop, J.W., Term Rewriting Systems with Priorities, Rewriting Techniques and Applications, Lecture Notes in Comp. Science 256, pp 83–94, 1987.
Berge, C., Graphes et Hypergraphes, Dunod, Paris, 1970.
Billaud, M., Lafon, P., Metivier, Y., Sopena, E., Graph Rewriting Systems with Priorities: Definitions and Applications, Technical Report no 8909, LABRI, Université Bordeaux I, 1989.
Dijkstra, E.W., and Scholten, C.S, Termination Detection for Diffusing Computations, Information Processing Letters. 11, pp 1–4, 1980.
Hoare, C.A.R., Communicating Sequential Processes, Comm. ACM, Vol 21 no8 pp 666–676, Aug. 1978.
Mohan, C.K., Priority Rewriting: Semantics, Confluence and Conditionnals, Rewriting Techniques and Applications, Lecture Notes in Comp. Science 256, pp 278–291, 1987.
Raynal, M., Algorithmes Distribués et Protocoles, Eyrolles 1985.
Raynal, M., Systèmes Répartis et Réseaux: Concepts Outils et Algorithmes, Eyrolles 1987.
Topor, R.W., Termination Detection for Distributed Computations, Information Processing Letters 18 (1984) pp 33–36.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Billaud, M., Lafon, P., Metivier, Y., Sopena, E. (1990). Graph rewriting systems with priorities. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1989. Lecture Notes in Computer Science, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52292-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-52292-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52292-8
Online ISBN: 978-3-540-46950-6
eBook Packages: Springer Book Archive