Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting

@inproceedings{Ehrig2004DerivingBC,
  title={Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting},
  author={Hartmut Ehrig and Barbara K{\"o}nig},
  booktitle={FoSSaCS},
  year={2004}
}
Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the DPO (double-pushout) approach to graph rewriting. Unlike in previous approaches, we consider graphs as objects, instead of arrows, of the category under consideration. This allows us to present a very simple way of deriving labelled transitions (called rewriting steps with borrowed context) which smoothly integrates with the DPO… CONTINUE READING
BETA

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

156 Citations

0102030'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 156 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…