In this chapter, novel ideas for possible improvement of Petri nets analysis
methods are presented. The proposed algorithms are not only dedicated to larger Petri
nets, where, as expounded in detail in the previous chapters, exact methods cannot
compute in the assumed time. For larger Petri nets, that is, nets with several and more
places, the described algorithms do not provide a perfect solution for all cases because,
as discussed earlier, the problems are of exponential character. However, the recent ideas
presented in this chapter will certainly support concurrent control designers in the field
of modeling and analyzing Petri nets.
Keywords: Analysis, Boundedness, Coverability graph, Invariants, Safeness.
