Update-data-driven execution of nets

Implementing Petri net execution means implementing an algorithm that mimics the dynamic behavior of the net under various initial conditions. A parallel programming model is presented that expresses the net characteristics of parallelism, locality, decentralized conflict adjudication and nondeterminism in a natural and efficient way. The programming model consists of a general net class, a net representation, and an execution scheme. The net class is based on the idea of generalized computation nets (GCNs). A GCN is represented for distributed execution by a program graph. The basic functions defined for graph evaluation realize the concept of update-driven data flow. The execution scheme guarantees the preservation of the correspondence of a graph marking to the net marking after node executions. The scheme is based on levelizing the graph´s nodes so that the nodes located on the same level can be executed in parallel and without any constraints