Abstract:
The software implementation of a method for generation of Petri nets having millions of elements of places and transitions is described. Particular attention is paid to the internal data structures and algorithmic complexity of the method. The presented material allowed the authors to obtain a software tool with computational complexity $O(n)$ where $n$ is the number of elements in a model. The described theoretical results are justified by the performance tests in practical experiments.
Keywords:Petri nets; program model; data structures; algorithm analysis; object-oriented programming.