Skip to main content

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
Home
Article
    • Aa
    • Aa
  • Cited by 4
  • Cited by
    Crossref Citations
    Crossref logo
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Eichhoff, Julian R. Schmidt, Jens and Roller, Dieter 2016. Inducing production rules to extend existing design grammars: The parse/derive method. Computer-Aided Design and Applications, p. 1.

    Eichhoff, Julian R. Baumann, Felix and Roller, Dieter 2016. Cooperative Design, Visualization, and Engineering.

    Löwe, Michael König, Harald Schulz, Christoph and Schultchen, Marius 2015. Algebraic graph transformations with inheritance and abstraction. Science of Computer Programming, Vol. 107-108, p. 2.

    Padberg, Julia and Hoffmann, Kathrin 2015. A Survey of Control Structures for Reconfigurable Petri Nets. Journal of Computer and Communications, Vol. 03, Issue. 02, p. 20.

    ×
  • Get access
    Add to cart $35.00
    Check if you have access via personal or institutional login
    Log in Register Recommend to librarian

$\mathcal{M}$-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation

  • HARTMUT EHRIG (a1), ULRIKE GOLAS (a2), ANNEGRET HABEL (a3), LEEN LAMBERS (a4) and FERNANDO OREJAS (a5)...
Abstract

Nested application conditions generalise the well-known negative application conditions and are important for several application domains. In this paper, we present Local Church–Rosser, Parallelism, Concurrency and Amalgamation Theorems for rules with nested application conditions in the framework of $\mathcal{M}$-adhesive categories, where $\mathcal{M}$-adhesive categories are slightly more general than weak adhesive high-level replacement categories. Most of the proofs are based on the corresponding statements for rules without application conditions and two shift lemmas stating that nested application conditions can be shifted over morphisms and rules.

Copyright
COPYRIGHT: © Cambridge University Press 2014 
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

F. Baader and T. Nipkow (1998) Term Rewriting and All That, Cambridge University Press.
P. Baldan , F. Gadducci and P. Sobocinski (2011) Adhesivity is not enough: Local Church–Rosser revisited. In: Mathematical Foundations of Computer Science (MFCS 2011). Springer-Verlag Lecture Notes in Computer Science 6907 48–59.
E. Biermann , H. Ehrig , C. Ermel , U. Golas and G. Taentzer (2010) Parallel independence of amalgamated graph transformations applied to model transformation. In: Graph Transformations and Model-Driven Engineering. Springer-Verlag Lecture Notes in Computer Science 5765 121–140.
P. Boehm , H.-R. Fonio and A. Habel (1987) Amalgamation of graph transformations: A synchronization mechanism. Journal of Computer and System Sciences 34 377–408.
I. Castellani and U. Montanari (1983) Graph grammars for distributed systems. In: Graph Grammars and Their Application to Computer Science. Springer-Verlag Lecture Notes in Computer Science 153 20–38.
A. Corradini , U. Montanari , F. Rossi , H. Ehrig , R. Heckel and M. Löwe (1997) Algebraic approaches to graph transformation. Part I: Basic concepts and double pushout approach. In: Handbook of Graph Grammars and Computing by Graph Transformation 1, World Scientific163–245.
A. Corradini , F. Rossi and F. Parisi-Presicce (1991) Logic programming as hypergraph rewriting. In: Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT'91). Springer-Verlag Lecture Notes in Computer Science 493 275–295.
B. Courcelle (1997) The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of Graph Grammars and Computing by Graph Transformation 1, World Scientific313–400.
E. Csuhaj-Varjú (1993) On grammars with local and global context conditions. International Journal of Computer Mathematics 47 17–27.
J. Dassow and G. Păun (1989) Regulated Rewriting in Formal Language Theory, EATCS Monographs on Theoretical Computer Science 18, Springer-Verlag.
P. Degano and U. Montanari (1987) A model of distributed systems based on graph rewriting. Journal of the ACM 34 411–449.
E. W. Dijkstra (1965) Solution of a Problem in Concurrent Programming Control. Communications of the ACM 8 569.
H. Ehrig (1979) Introduction to the algebraic theory of graph grammars. In: Graph-Grammars and Their Application to Computer Science and Biology. Springer-Verlag Lecture Notes in Computer Science 73 1–69.
H. Ehrig and A. Habel (1986) Graph grammars with application conditions. In: G. Rozenberg and A. Salomaa (eds.) The Book of L, Springer-Verlag87–100.
H. Ehrig and H.-J. Kreowski (1980) Applications of graph grammar theory to consistency, synchronization and scheduling in database systems. Information Systems 5 225–238.
H. Ehrig and F. Parisi-Presicce (1992) High-level-replacement systems for equational algebraic specifications. In: Algebraic and Logic Programming – proceedings Third International Conference. Springer-Verlag Lecture Notes in Computer Science 632 3–20.
H. Ehrig and B. Rosen (1980) Parallelism and concurrency of graph manipulations. Theoretical Computer Science 11 247–275.
H. Ehrig , G. Engels , H.-J. Kreowski and G. Rozenberg (eds.) (1999) Handbook of Graph Grammars and Computing by Graph Transformation 2: Applications, Languages and Tools, World Scientific.
K. Ehrig , J. M. Küster and G. Taentzer (2009) Generating instance models from meta models. Software and System Modeling 8 (4) 479–500.
A. Habel and D. Plump (2001) Computational completeness of programming languages based on graph transformation. In: Foundations of Software Science and Computation Structures – proceedings FOSSACS 2001. Springer-Verlag Lecture Notes in Computer Science 2030 230–245.
A. Habel , K-H. Pennemann and A. Rensink (2006) Weakest preconditions for high-level programs. In: Graph Transformations (ICGT 2006). Springer-Verlag Lecture Notes in Computer Science 4178 445–460.
R. Heckel and A. Wagner (1995) Ensuring consistency of conditional graph grammars – a constructive approach. In: Workshop on Graph Rewriting and Computation – proceedings SEGRAGRA'95. Electronic Notes in Theoretical Computer Science 2 95–104.
R. Heckel , M. Llabrés , H. Ehrig and F. Orejas (2002) Concurrency and loose semantics of open graph transformation systems. Mathematical Structures in Computer Science 12 (4) 349–376.
T. Heindel (2010) Hereditary Pushouts Reconsidered. In: Graph Transformations (ICGT'10). Springer-Verlag Lecture Notes in Computer Science 6372 250–265.
C. A. R. Hoare (1969) An axiomatic basis for computer programming. Communications of the ACM 12 576–580, 583.
D. E. Knuth and P. B. Bendix (1970) Simple word problems in universal algebras. In: Computational Problems in Abstract Algebras, Pergamon Press263–297.
M. Koch , L. V. Mancini and F. Parisi-Presicce (2005) Graph-based specification of access control policies. Journal of Computer and System Sciences 71 1–33.
S. Lack and P. Sobociński (2004) Adhesive categories. In: Foundations of Software Science and Computation Structures (FOSSACS'04). Springer-Verlag Lecture Notes in Computer Science 2987 273–288.
S. Lack and P. Sobociński (2005) Adhesive and quasiadhesive categories. Theoretical Informatics and Application 39 (2) 511–546.
F. Parisi-Presicce (1989) Modular system design applying graph grammar techniques. In: Automata, Languages and Programming – proceedings ICALP89. Springer-Verlag Lecture Notes in Computer Science 372 621–636.
D. Plump (2005) Confluence of graph transformation revisited. In: Processes, Terms and Cycles: Steps on the Road to Infinity – Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday. Springer-Verlag Lecture Notes in Computer Science 3838 280–308.
A. Rensink (2004) Representing first-order logic by graphs. In: Graph Transformations – proceedings ICGT'04. Springer-Verlag Lecture Notes in Computer Science 3256 319–335.
B. K. Rosen (1975) A Church–Rosser theorem for graph grammars (announcement). SIGACT News 7 (3) 26–31.
G. Rozenberg (ed.) (1997) Handbook of Graph Grammars and Computing by Graph Transformation 1: Foundations, World Scientific.
G. Taentzer , M. Koch , I. Fischer and V. Volle (1999) Distributed graph transformation with application to visual design of distributed systems. In: H. Ehrig , H.-J. Kreowski , U. Montanari and G. Rozenberg (eds.) Handbook of Graph Grammars and Computing by Graph Transformation 3: Concurrency, Parallelism, and Distribution, World Scientific269–340.
J. Winkelmann , G. Taentzer , K. Ehrig and J. M. Küster (2008) Translation of restricted OCL constraints into graph constraints for generating meta model instances by graph grammars. In: Proceedings GT-VMT 2006. Electronic Notes in Theoretical Computer Science 211 159–170.
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? *

CAPTCHA *

Skip to the audio challenge
×

Metrics

Full text views

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

Abstract views

Total abstract views: 153 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 21st July 2017. This data will be updated every 24 hours.

Cancel
Confirm
×