Final marking of continuous neutral weighted marked graphs

We consider continuous Petri nets that are used to model high throughput systems and flow systems. More advanced, continuous marked graphs are well adapted to model cyclic systems in a compact form. Nevertheless, to evaluate performances of continuous models, it is still necessary to study the evolution graph of the model. However, the determination of all the occurred events can be long and tedious. Therefore, this paper presents a new algebraic method based on the graph theory to determine the final marking vector