ALGORITHMS FOR COMPUTING COVERABILITY GRAPHS FOR CONTINUOUS PETRI NETS

A useful method for Petri nets analysis is based on a coverability tree or a coverability graph that represents a state space of a system. The paper formalizes the concept of the coverability graphs for autonomous continuous Petri nets and introduces algorithms for their computing. The algorithms for the bounded and unbounded continuous Petri nets are presented. Every algorithm is accompanied with an example. The new concept of a signed continuous macro-marking for the bounded continuous Petri nets is described.