Petri Nets Representation Approach through Chained Linear Lists

The development of automated systems that meet the desired reliability and efficiency criteria requires the use of scientifically proven modelling tools. Petri nets, which were invented in the 1960s, have allowed designers and analysts to conduct formal studies of future system properties during the modelling stage. Modelling, construction, and synthesis of systems are carried out using various analysis methods derived from the ontological foundation of Petri nets, such as places, transitions, tokens, cover graphs, marker graphs, place invariants, and transition invariants. Each of these methods has benefits and drawbacks. Several models for designing automated systems now exist and coexist, including Markov chains, queues, stacks, graphs, forests and least squares. The current study suggests a novel way to describe Petri nets as chained linear lists. It seeks to give designers and engineers the opportunity to change the initial structure of Petri Nets using processing methods similar to those applied to linear list data structures. As a result, the strategy or technique allows for the broadening of the ontological basis of Petri nets by specifying the requirements for a Petri net representation in the form of chained linear lists.