scientific article

zbMath0643.68102MaRDI QIDQ3785984

Hartmut Ehrig

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph grammargluingsequential dependenceparallel dependence

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (26)

Term graph rewriting and garbage collection using opfibrations ⋮ Contextual nets ⋮ Non-perturbative graph languages, halting problem and complexity ⋮ Graph-grammar semantics of a higher-order programming language for distributed systems ⋮ Abstract graph derivations in the double pushout approach ⋮ Set-theoretic graph rewriting ⋮ Patch Graph Rewriting ⋮ Concurrent graph and term graph rewriting ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hypermap rewriting: A combinatorial approach ⋮ Locating the contractum in the double pushout approach ⋮ Confluence theory for graphs ⋮ The contractum in algebraic graph rewriting ⋮ The category of typed graph grammars and its adjunctions with categories of derivations ⋮ An event structure semantics for graph grammars with parallel productions ⋮ Synchronized composition of graph grammar productions ⋮ Algebraic approach to single-pushout graph transformation ⋮ Equivalence of computations in actor grammars ⋮ Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming ⋮ Computation graphs for actor grammars ⋮ Concurrency for Graph Grammars in a Petri net shell ⋮ Concurrent semantics for fusions: weak prime domains and connected event structures ⋮ Generating irregular partitionable data structures ⋮ Contextual Petri nets, asymmetric event structures, and processes ⋮ An abstract machine for concurrent modular systems: CHARM

This page was built for publication: