Algorithm Modelling with Petri Nets - Comparison with Data Dependence Graphs

  • Published 1998

Abstract

This article focuses on algorithm representation by means of Petri Nets. The basic structural features of algorithms are dictated by their data and control dependencies. These dependencies refer to the precedence relations of computation that need to be satis ed in order to compute the problem correctly. The absence of dependencies indicates the possibility… (More)

Topics

10 Figures and Tables

Slides referencing similar topics