Output details
11 - Computer Science and Informatics
University of Leicester
DPO Transformation with Open Maps
<10>The work was used as evidence by Danos et al. (FSTTCS'12, CONCUR'13) Hayman et al. (FOSSACS'13) that their kappa graph rewriting language for biological modelling is strongly related to the mainstream theory based on adhesive categories and that, in particular, the unusual matching constraints can be handled categorically.
A fundamental flaw in the model of concurrency of transformations with negative application conditions (NACs) found in the the paper has renewed the interest in concurrency theory of graph transformation with NACs and inspired an informal Workshop on Graph Transformation and Concurrency (GT&C'13) where, in particular, concurrency of controlled transformations was discussed.