On graph rewritings
From MaRDI portal
Publication:800736
DOI10.1016/0304-3975(84)90021-5zbMATH Open0551.68065OpenAlexW2092445638MaRDI QIDQ800736FDOQ800736
Authors: Jean Claude Raoult 
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90021-5
Recommendations
Cites Work
Cited In (54)
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- Title not available (Why is that?)
- Algebraic approach to single-pushout graph transformation
- Categorical principles, techniques and results for high-level-replacement systems in computer science
- Extending graph rewriting with copying
- On ``On graph rewritings
- Set-theoretic graph rewriting
- Term graph rewriting and garbage collection using opfibrations
- Computing with graph rewriting systems with priorities
- Comparison of two graph-rewrite systems
- Single Pushout Rewriting in Comprehensive Systems
- The first-order theory of ground tree rewrite graphs
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- A categorical manifesto
- Confluence of indirection reductions in graph rewrite systems
- Multilevel graph grammars
- Properties of graphs preserved by relational graph rewritings
- On the reachability of a version of graph-rewriting system
- The contractum in algebraic graph rewriting
- A Heterogeneous Pushout Approach to Term-Graph Transformation
- Algebraic transformation of unary partial algebras II: Single-pushout approach
- A small final coalgebra theorem
- On categorical graph grammars integrating structural transformations and operations on labels
- Lambda calculus with explicit recursion
- Parallelism in single-pushout graph rewriting
- Term rewriting in CTΣ
- Graph rewriting for the π-calculus
- A decade of TAPSOFT
- Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
- Graph expressions and graph rewritings
- Single pushout rewriting in comprehensive systems of graph-like structures
- Title not available (Why is that?)
- Strategic port graph rewriting: an interactive modelling framework
- Implementing term rewriting by jungle evaluation
- Redex capturing in term graph rewriting (concise version)
- Unification of drags and confluence of drag rewriting
- Incremental Update for Graph Rewriting
- On relating rewriting systems and graph grammars to event structures
- Note on node-rewriting graph grammars
- Drags: a compositional algebraic framework for graph rewriting
- Relating graph and term rewriting via Böhm models
- Relational structures and their partial morphisms in view of single pushout rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditional rewriting logic as a unified model of concurrency
- A local graph-rewriting system for deciding equality in sum-product theories
- Generating irregular partitionable data structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Thermodynamic Graph-Rewriting
- Confluence for graph transformations
- Relational graph rewritings
- Parallel and distributed derivations in the single-pushout approach
- Algebraic properties and transformations of monographs
This page was built for publication: On graph rewritings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800736)
