Skip to main content
×
×
Home

Parallelism and concurrency in high-level replacement systems

  • Hartmut Ehrig (a1), Annegret Habel (a2), Hans-Jörg Kreowski (a2) and Francesco Parisi-Presicce (a3)
Abstract

High-level replacement systems are formulated in an axiomatic algebraic framework based on categories pushouts. This approach generalizes the well-known algebraic approach to graph grammars and several other types of replacement systems, especially the replacement of algebraic specifications which was recently introduced for a rule-based approach to modular system design.

in this paper basic notions like productions, derivations, parellel and sequential independence are introduced for high-level replacement syetms leading to Church-Rosser, Parallelism and concurrency Theorems previously shown in the literature for special cases only. In the general case of high-level replacement systems specific conditions, called HLR1- and HLR2-conditions, are formulated in order to obtain these results.

Several examples of high-level replacement systems are discussed and classified w.r.t. HLR1- and HLR2-conditions showing which of the results are valid in each case.

Copyright
References
Hide All
Arbib, M. A. and Manes, E. G. (1975) Arrows, Structures and Functors. Academic Press, New York–San Francisco–London.
Claus, V., Ehrig, H. and Rozenberg, G., eds, (1979) Graph grammars and their application to computer science and biology. Springer Lecture Notes in Computer Science 73.
Corradini, A., Montanari, U., Rossi, F., Ehrig, H. and Löwe, M. (1991a) Graph grammars and logic programming. Proc. 4th Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science, to appear
Corradini, A., Rossi, F. and Parisi-Presicce, F. (1991b) Logic programming as hypergraph rewriting, In Proc. CAAP'91. Springer Lecture Notes in Computer Science 493 275295.
Ehrig, H. (1979) Introduction to the algebraic theory of graph grammars. Proc. 1st Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science 73 pp 169.
Ehrig, H., Habel, A., Kreowski, H.-J. and Parisi-Presicce, F. (1991a) From graph grammars to high level replacement systems. Proc. 4th Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science, to appear.
Ehrig, H., Habel, A. and Rosen, B. K. (1986) Concurrent transformations of relational structures. Fundamenta Informaticae IX 1350.
Ehrig, H. and Kreowski, H.-J. (1975) Categorical theory of graph grammars. Techn. Report TU Berlin, FB 20, Bericht Nr. 75-50.
Ehrig, H. and Kreowski, H.-J. 1979) Pushout properties: an analysis of gluing constructions for graphs. Math. Nachr. 91 135149.
Ehrig, H., Kreowski, H.-J. and Rozenberg, G. (1991b) Graph grammars and their applications to computer science. Proc. 4th Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science, to appear.
Ehrig, H., Kreowski, H.-J., Maggiolo-Schettini, A., Rosen, B. and Winkowski, J. (1981) Transformation of structures: an algebraic approach. Math. Syst. Theory 14 305334.
Ehrig, H. and Mahr, B. (1985) Fundamentals of algebraic specification 1. Equations and intial semantics. Springer EATCS Monographs on Theoretical Computer Science 6.
Ehrig, H., Nagl, M. and Rozenberg, G., eds, (1983) Graph grammars and their application to computer science. Proc. 2nd Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science 153.
Ehrig, H., Nagl, M., Rozenberg, G. and Rosenfeld, A., eds, (1987) Graph grammars and their application to computer science. Proc. 2nd Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science 291.
Ehrig, H. and Rosen, B. K. (1980) Parallelism and concurrency of graph manipulations. Theor. Comp. Sci. 11 247–275.
Ehrig, H., Pfender, M. and Schneider, H. J. (1973) Graph grammars: an algebraic approach. Proc. IEEE Conf. SWAT73, Iowa City pp 167180.
Habel, A. (1989) Hyperedge replacement: grammars and languages. PhD Thesis, University of Bremen. To appear in Springer Lecture Notes in Computer Science.
Hummert, U. (1989) Algebraische Theorie von High-Level-Netzen. PhD Thesis, TU Berlin.
Herrlich, H. and Strecker, G. E. (1973) Category Theory. Allyn and Bacon, Boston.
Kennaway, R. (1991) Graph rewriting in some categories of partial morphisms. Proc. 4th Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science, to appear.
Kreowski, H.-J. (1977a) Manipulation von Graphmanipulationen, PhD Thesis, TU Berlin.
Kreowski, H.-J. (1977b) Transformations of derivation sequences in graph grammars. Springer Lecture Notes in Computer Science 56 275286.
MacLane, S (1972) Categories for the Working Mathematician. springer, New York–Heidelberg–Berlin.
Meseguer, P. and Montanari, U. (1988) Petri nets are monoids: a new algebraic foundation for net theory. Proc. Logics in Comp. Sci. also in Information and Computation 88 (2) (1990).
Parisi-Presicce, F. (1989) Modular system design applying graph grammar techniques. In: Proc. 16th ICALP. Springer Lecture Notes in Computer Science 372 621636.
Parisi-Presicce, F. (1990) A rule based approach to modular system design. Proc. 12th Int. Conf. Software Engineering.
Parisi-Presicce, F. and Ehrig, H. (1991) Algebraic specification grammars. Proc. 4th Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science, on appear.
Parisi-Presicce, F., Ehrig, H. and Montanari, U. (1987) Graph rewriting with unification and composition. In: Proc. 3rd Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science 291 496511.
Schneider, H. J. and Ehrig, H. (1976) Grammars on partial graphs. Acta Informatica 6 297316.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed