Modelling simple network graphs using the matrix vector transition net

Abstract

Petri nets and graph modelling are popular topics in computing and other fields. Different structures and complexities can be represented using graphs. In information graphics graph topologies find suggested use for representing formal and informal natural occurring structures and relationships. Basically graph types can be divided into two simple types i) directed and ii) non-directed. Other characteristics and properties can be included. Certain types of simple graphs can easily be represented using matrix structures. The incidence matrix, and the adjacency matrix for a graph can be used as input or outputs in the MVTN (matrix vector transition net). The MVTN was presented in previous work. The reasons for combining graph structures with the MVTN are discussed in section II) and III). The MVTN is based on Petri net principles. Some advanced uses of the MVTN and using graph structures as inputs are given in sections IV) and V). Some simple examples are also given and discussed in section VI). These models can be executed and preserve Petri net like properties. They can be further enhanced. Some results and findings are presented in section VII).