Concurrency of manipulations in multidimensional information structures
Given a sequence of manipulation rules together with dependence relations (allowing later rules to depend on the effects of earlier rules), we construct a single "concurrent manipulation rule" with the following property: Each application of the sequence of rules to a multidimensional information structure — such that the dependence relations are respected — can be performed in a single step applying the concurrent manipulation rule to the same structure. Moreover this becomes a bijective correspondence between such manipulation sequences and "concurrent manipulations". This "Concurrency Theorem" is formulated and proved in the framework of the algebraic theory of graph grammars using new pushout and pullback lemmas for the 3- and 4-dimensional cube. As corollaries we obtain a recently published Church-Rosser-Theorem for graph derivations and a theorem reducing the strong to the weak Church-Rosser-property.
Key WordsConcurrency Multidimensional Information Structures Graph Grammars Parallelism Church-Rosser-Properties Applications of Category Theory
Unable to display preview. Download preview PDF.
- /ER 78/.Ehrig, H. — Rosen, B.K.: Concurrency of Manipulations in Multidimensional Information Structures (long version), Technical Report TU Berlin, FB 20, No. 78-13 (1978)Google Scholar
- /AM 75/.Arbib, M.A. — Manes, E.G.: Arrows, Structures, and Functors, Academic Press, New York, 1975Google Scholar
- /EK 76a/.Ehrig, H. — Kreowski, H.-J.: Parallelism of Manipulations in Multidimensional Information Structures, Springer Lecture Notes Comp. Sci. 45 (1976), 284–293Google Scholar
- /EK 76b/.—: Contributions to the Algebraic Theory of Graph Grammars, Technical Report TU Berlin, FB 20, No. 76-22 (1976), Part 1, to appear in Math. Nachr.Google Scholar
- /EKMRW 78/.Ehrig, H. — Kreowski, H.-J. — Maggiolo-Schettini, A. — Rosen, B.K. — Winkowski, J.: Deriving Structures from Structures, this volumeGoogle Scholar
- /EPS 73/.Ehrig H. — Pfender, M. — Schneider, H.J.: Graph Grammars: An Algebraic Approach, Proc. IEEE Conf. on Automata and Switching Theory, Iowa City 1973, 167–180Google Scholar
- /ER 76/.Ehrig, H. — Rosen, B.K.: Commutativity of Independent Transformations of Complex Objects, IBM Research Report RC 6251 (Oct 1976)Google Scholar
- /ER 77/.—: The Mathematics of Record Handling, Springer Lect. Notes Comp. Sci. 52 (1977), 206–220Google Scholar
- /FKZ 76/.Farrow, R. — Kennedy, K. — Zucconi, L.: Graph Grammars and Global Program Data Flow Analysis, Proc. 17th Ann. IEEE Symp. on Foundations of Comp. Sci., Houston, Oct. 1976, pp. 42–56Google Scholar
- /Kr 77/.Kreowski, H.-J.: Transformations of Derivation Sequences, Springer Lect. Not. Comp. Sci. 56 (1977), 275–286Google Scholar
- /Ra 75/.Rajlich, V.: Dynamics of Discrete Systems..., J. Comp. and Syst. Sci., 11 (1975), pp. 186–202Google Scholar
- /Ro 75/.
- /SE 76/.