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)

- Algorithm
- Petri net
- algorithm
- Data dependency
- Sequential algorithm
- Marked graph
- Branch (computer science)
- Problem solving
- Automatic parallelization
- Directed graph
- Dependence analysis
- Computer memory
- Parallel computing
- Computation
- Iteration
- Program counter
- Data (computing)
- Programmer
- Loop (graph theory)
- Foreach loop
- Pointer (computer programming)
- Graph - visual representation
- Geodetic datum
- Directed acyclic graph
- paragraphs