Using graph transformations to specify the dynamics of distributed systems and networks, we require a precise understanding of concurrency. Negative application conditions (NACs) are an essential means for controlling the application of rules, extending our ability to model complex systems. A classical notion of concurrency in graph transformation is based on shift equivalence and its representation by canonical derivations, i.e., normal forms of the shift operation anticipating independent steps. These concepts are lifted to graph transformation systems with NACs and it is shown that canonical derivations exist for so-called incremental NACs. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Corradini, A., & Heckel, R. (2014). Canonical derivations with negative application conditions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8571 LNCS, pp. 207–221). Springer Verlag. https://doi.org/10.1007/978-3-319-09108-2_14
Mendeley helps you to discover research relevant for your work.