Concurrent Rewriting for Graphs with Equivalences (Q5756599)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Concurrent Rewriting for Graphs with Equivalences |
scientific article; zbMATH DE number 5187256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concurrent Rewriting for Graphs with Equivalences |
scientific article; zbMATH DE number 5187256 |
Statements
Concurrent Rewriting for Graphs with Equivalences (English)
0 references
4 September 2007
0 references
concurrent graph rewriting
0 references
dpo approach
0 references
graphical encoding of nominal calculi
0 references
graph process semantics
0 references
0.900927722454071
0 references
0.8159448504447937
0 references
0.7963862419128418
0 references
