From graph grammars to high level replacement systems

DOI10.1007/BFB0017395MaRDI QIDQ4037314zbMATH OpenFDO

Authors Hartmut Ehrig, Francesco Parisi-Presicce, Annegret Habel

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0017395

zbMATH Keywords

algebraic specificationscategoriesChurch-Rosser theoremderivationsgraph grammarsparallelism theoremproductionspushoutsreplacement systemssequential independence

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Parallelism and concurrency in high-level replacement systems
• Transformations of graph grammars
• Basic results for two types of high-level replacement systems
• Parallel high-level replacement systems
• Canonical derivations for high-level replacement systems

Cited in

(36)

• Characteristics of graph languages generated by edge replacement
• First steps towards an institution of algebra replacement systems
• Parallel high-level replacement systems
• Categorical approach to horizontal structuring and refinement of high-level replacement systems
• Single pushout rewriting in comprehensive systems of graph-like structures
• Finite limits and anti-unification in substitution categories
• Petri net modules in the transformation-based component framework
• scientific article; zbMATH DE number 446837 (Why is no real title available?)
• From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
• Process Construction and Analysis for Workflows Modelled by Adhesive HLR Systems with Application Conditions
• scientific article; zbMATH DE number 3915647 (Why is no real title available?)
• Parallelism and concurrency in high-level replacement systems
• From parallel graph grammars to parallel high-level replacement systems
• Algebraic specification grammars: A junction between module specifications and graph grammars
• scientific article; zbMATH DE number 4125035 (Why is no real title available?)
• Redundancy and subsumption in high-level replacement systems
• The contractum in algebraic graph rewriting
• Pragmatic and semantic aspects of a module concept for graph transformation systems
• Hierarchically distributed graph transformation
• Transformations of graph grammars
• Basic results for two types of high-level replacement systems
• Designing and Learning Substitutable Plane Graph Grammars
• Canonical derivations for high-level replacement systems
• Logic based structure rewriting systems
• A decade of TAPSOFT. Aspects of progress and prospects in theory and practice of software development
• On the expressive power of algebraic graph grammars with application conditions
• Allegories and collagories for transformation of graph structures considered as coalgebras
• Adhesive and quasiadhesive categories
• Horizontal and vertical structuring techniques for statecharts
• Multilevel graph grammars
• Specification of graph translators with triple graph grammars
• Locating the contractum in the double pushout approach
• Algebraic approach to single-pushout graph transformation
• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
• Categorical principles, techniques and results for high-level-replacement systems in computer science
• Construction and properties of adhesive and weak adhesive high-level replacement categories

This page was built for publication: From graph grammars to high level replacement systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037314)