Confluence of graph rewriting with interfaces
From MaRDI portal
Recommendations
Cites work
- A basic algebra of stateless connectors
- A categorical approach to open and interconnected dynamical systems
- A categorical semantics of signal flow graphs
- A connector algebra for P/T nets interactions
- A programming language for spatial distribution of net systems
- A survey of graphical languages for monoidal categories
- Adhesive and quasiadhesive categories
- Adhesivity is not enough: local Church-Rosser revisited
- Cartesian bicategories. I
- Categorical algebra
- Categories in control
- Computing critical pairs in 2-dimensional rewriting systems
- Conditional reactive systems
- Decorated cospans
- Diagrammatic reasoning for delay-insensitive asynchronous circuits
- Finite complete rewriting systems and the complexity of word problem
- Foundations of Software Science and Computation Structures
- Full abstraction for signal flow graphs
- Graph rewriting for the π-calculus
- Graph Transformations
- Higher-dimensional word problems with applications to equational logic
- scientific article; zbMATH DE number 5604126 (Why is no real title available?)
- scientific article; zbMATH DE number 1189283 (Why is no real title available?)
- scientific article; zbMATH DE number 3688683 (Why is no real title available?)
- scientific article; zbMATH DE number 3548465 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Interacting Quantum Observables
- Limits indexed by category-valued 2-functors
- Matrices, relations, and group representations
- Monoidal computer. I: Basic computability by string diagrams
- Normal forms for algebras of connections.
- On ground-confluence of term rewriting systems
- Petri nets are monoids
- Quantomatic: a proof assistant for diagrammatic reasoning
- Rewriting modulo symmetric monoidal structure
- Strong complementarity and non-locality in categorical quantum mechanics
- Synthesising CCS bisimulation using graph rewriting
- The algebra of directed acyclic graphs
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- The geometry of tensor calculus. I
- Towards 3-dimensional rewriting theory
- Towards an algebraic theory of Boolean circuits.
Cited in
(15)- Confluence up to garbage in graph transformation
- Single pushout rewriting in comprehensive systems of graph-like structures
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
- Drags: a compositional algebraic framework for graph rewriting
- Confluence theory for graphs
- Unification of drags and confluence of drag rewriting
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- String diagram rewrite theory. I: Rewriting with Frobenius structure
- Initial conflicts for transformation rules with nested application conditions
- The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter
- CARTOGRAPHER: a tool for string diagrammatic reasoning (tool paper)
- String diagram rewrite theory III: Confluence with and without Frobenius
- A strict constrained superposition calculus for graphs
- A Category of Surface-Embedded Graphs
- Rewriting modulo traced comonoid structure
This page was built for publication: Confluence of graph rewriting with interfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988637)
