Concurrent bisimulations in Petri nets
Acta Informatica
History Preserving Bisimulation for Contextual Nets
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
An inductive view of graph transformation
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Processes for adhesive rewriting systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Observing reductions in nominal calculi via a graphical encoding of processes
Processes, Terms and Cycles
| Hi-index | 0.00 |
This paper presents indispensable technical results of a general theory that will allow to systematically derive from a given reduction system a behavioral congruence that respects concurrency. The theory is developed in the setting of adhesive categories and is based on the work by Ehrig and Konig on borrowed contexts; the latter are an instance of relative pushouts, which have been proposed by Leifer and Milner. In order to lift the concurrency theory of dpo rewriting to borrowed contexts we will study the special case of dpo rewriting with monic matches in adhesive categories: more specifically we provide a generalized Butterfly Lemma together with a Local Church Rosser and Parallelism theorem.