Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets

Abstract: In the framework of graph transformation systems with Negative Ap-plication Conditions (NACs) the classical notion of switch equivalence of deriva-tions is extended to permutation equivalence, because there are intuitively equiva-lent derivations which are not switch-equivalent if NACs are considered. By def-inition, two derivations are permutation-equivalent, if they respect the NACs and disregarding the NACs they are switch equivalent. A direct analysis of permutation equivalence is very complex in general, thus we propose a much more efficient anal-ysis technique. For this purpose, we construct a Place/Transition Petri net, called dependency net, which encodes the dependencies among rule applications of the derivation, including the inhibiting effects of the NACs. The analysis of permutation equivalence is important for analysing simulation runs within development environments for systems modelled by graph transformation. The application of the technique is demonstrated by a graph transformation system within the context of workflow modelling. We show the effectiveness of the ap-proach by comparing the minimal costs of a direct analysis with the costs of the efficient analysis applied to a derivation of our example system