The unfolding of a graph grammar provides a compact and comprehensive representation of its behaviour, serving both as a semantic model and as the basis for scalable analysis techniques. We study the extension of the theory of unfolding to grammars with negative application conditions (NACs), discuss the challenges with the general case of NACs consisting of complex graph patterns and how they could be avoided by restricting to simpler, incremental NACs.
Unfolding graph grammars with negative application conditions
Corradini A.;
2019-01-01
Abstract
The unfolding of a graph grammar provides a compact and comprehensive representation of its behaviour, serving both as a semantic model and as the basis for scalable analysis techniques. We study the extension of the theory of unfolding to grammars with negative application conditions (NACs), discuss the challenges with the general case of NACs consisting of complex graph patterns and how they could be avoided by restricting to simpler, incremental NACs.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
