Algorithm modelling with Petri nets-comparison with data dependence graphs

This article focuses on algorithm representation by means of Petri nets and data dependence graphs. In order to detect antidependencies and output dependencies in Petri net representation we have introduced a term IP-dependencies (instruction-pointer-related data interactions). This original approach allows us to put knowledge of automatic parallelization via data dependence graphs and Petri nets onto the same theoretical platform and to join the two scientific branches.