scientific article; zbMATH DE number 4049096

MaRDI QIDQ3785985zbMATH OpenFDO

Authors Francesco Parisi-Presicce, Hartmut Ehrig, Ugo Montanari

Publication date 1987

zbMATH Keywords

algebraic theory of graph grammarscolor-preserving graph morphismscomposition of rulesconcurrency theoremdouble pushoutexpert systemsterm rewritingunification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Artificial intelligence (68T99)

Recommendations

• scientific article; zbMATH DE number 517053
• Efficient graph rewriting and its implementation
• On graph rewritings
• Graph expressions and graph rewritings
• scientific article; zbMATH DE number 4049097

Cited in

(19)

• Term graph rewriting and garbage collection using opfibrations
• Parallel high-level replacement systems
• Graph rewriting and relabeling with PBPO\textsuperscript{+}
• Restricted combinatory unification
• Drags: a compositional algebraic framework for graph rewriting
• Graph-based specification of access control policies
• Unification of drags and confluence of drag rewriting
• Rational unification in 28 characters
• Graph Transformation by Computational Category Theory
• scientific article; zbMATH DE number 177436 (Why is no real title available?)
• Graph unification and matching
• Marker-directed optimization of UnCAL graph transformations
• Extending graph rewriting with copying
• A formal model for role-based access control using graph transformation
• Graph rewriting and relabeling with PBPO^+: a unifying theory for quasitoposes
• Multilevel graph grammars
• On categorical graph grammars integrating structural transformations and operations on labels
• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
• Categorical principles, techniques and results for high-level-replacement systems in computer science

This page was built for publication:

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