Net Refinement by Pullback Rewriting


The notion of pullback rewriting has been developed recently as a category theoretical framework for vertex replacement in graphs. Here, the technique is presented based on net morphisms, yielding a well-deened mechanism which is closely related to pullback rewriting in hypergraphs. Finally, a net reenement operation modifying the context of the reened… (More)
DOI: 10.1007/BFb0053550