scientific article
From MaRDI portal
Publication:4037314
zbMath0765.68088MaRDI QIDQ4037314
Hartmut Ehrig, Francesco Parisi-Presicce, Annegret Habel
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
derivationsalgebraic specificationscategoriesgraph grammarspushoutssequential independencereplacement systemsChurch-Rosser theoremproductionsparallelism theorem
Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)
Related Items (24)
Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras ⋮ Petri net modules in the transformation-based component framework ⋮ Adhesive and quasiadhesive categories ⋮ Canonical derivations for high-level replacement systems ⋮ Logic based structure rewriting systems ⋮ A decade of TAPSOFT ⋮ On the expressive power of algebraic graph grammars with application conditions ⋮ Finite limits and anti-unification in substitution categories ⋮ Horizontal and vertical structuring techniques for statecharts ⋮ Multilevel graph grammars ⋮ Specification of graph translators with triple graph grammars ⋮ From Algebraic Graph Transformation to Adhesive HLR Categories and Systems ⋮ Process Construction and Analysis for Workflows Modelled by Adhesive HLR Systems with Application Conditions ⋮ Construction and properties of adhesive and weak adhesive high-level replacement categories ⋮ Locating the contractum in the double pushout approach ⋮ 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 ⋮ 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 ⋮ Basic Results for Two Types of High-Level Replacement Systems ⋮ Single pushout rewriting in comprehensive systems of graph-like structures
This page was built for publication:
