Rewriting Petri Nets as Directed Graphs
In this paper, the authors attempts to understand some of the basic properties of Petri nets and their relationships to directed graphs. Different forms of directed graphs are widely used in computer science. Normally, various names are given to these structures. e.g. Directed Acyclical Graphs (DAGs), Control Flow Graphs (CFGs), task graphs, Generalized Task Graphs (GTGs), State Transition Diagrams (STDs), state machines, etc. Some structures might exhibit bisimilarity. The justification for this paper is that Petri nets are based on graphs and have some similarities to them. Transforming Petri nets into graphs opens up a whole set of new interesting possible experimentations. Normally this is overlooked. Directed Graphs have a lot of theory and research associated with them.