Abstract
Dependence graphs (which are special kinds of acyclic directed node labeled graphs) are very fundamental objects in the theory of traces approach to concurrent systems and in the theory of graph grammars.
In this paper we characterize dependence graphs and naked dependence graphs — where a naked dependence graph is the unlabeled graph obtained from a dependence graph by removing its node labels.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aalbersberg, IJ.J. and Rozenberg, G., Theory of traces, Dept. of Computer Science, University of Leiden, Techn. Report No. 86-16, 1986.
Aalbersberg, IJ.J. and Rozenberg, G., Traces, dependence graphs and DNLC grammars, Discrete Applied Mathematics, v. 11, pp. 299–306, 1985.
Bertoni, A., Mauri, G. and Sabadini, N., Equivalence and membership problems for regular trace languages, Lecture Notes in Computer Science, v. 140, pp. 61–71, 1982.
Cartier, P. and Foata, D., Problemes combinatoires de commutation et rearrangements, Lecture Notes in Mathematics, v. 85, 1981.
Cori, R. and Perrin, D., Automates et commutations partielles, RAIRO, Informatique Theorique, v. 19, pp. 21–32, 1985.
H. Ehrig, M. Nagl and G. Rozenberg (eds.), Graph grammars and their applications to computer science, Lecture Notes in Computer Science, v. 153, 1983.
Ehrenfeucht, A. and Rozenberg, G., Structures and clans, Dept. of Computer Science, University of Colorado at Boulder, Technical Report No. CU-CS-328-86, Boulder, 1986.
Fle, M.P. and Roucairol, G., On serializability of iterated transactions, Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pp. 194–200, 1982.
Janssens, D. and Rozenberg, G., On the structure of node-label controlled graph languages, Information Sciences, v. 20, pp. 191–216, 1980.
Janssens, D. and Rozenberg, G., A characterization of context-free string languages by directed node-label controlled graph grammars, Acta Informatica, v. 16, pp. 63–85, 1981.
Keller, R.M., A solvable program-schema equivalence problem, Proc. 5th Annual Princeton Conference on Information Sciences and Systems, pp. 301–306, Princeton, 1971.
Mazurkiewicz, A., Concurrent program schemes and their interpretations, Dept. of Computer Science, University of Aarhus, Technical Report No. PB-78, Aarhus, 1977.
Ochmanski, E., Regular trace languages, Ph.D. Thesis, Dept. of Mathematics, University of Warsaw, 1985.
Rozenberg, G. and Welzl, E., Boundary NLC grammars. Basic definitions, normal forms and complexity, Information and Control, v. 69, pp. 136–167, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ehrenfeucht, A., Rozenberg, G. (1987). On the Structure of Dependence Graphs. In: Voss, K., Genrich, H.J., Rozenberg, G. (eds) Concurrency and Nets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72822-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-72822-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-72824-2
Online ISBN: 978-3-642-72822-8
eBook Packages: Springer Book Archive