Towards a new exhaustive simulation technique for P-time Petri nets

Abstract

Petri nets are a powerful formalism for the specification and verification of concurrent systems, such as sequential systems and manufacturing systems where many processes can compete for limited and constrained ressources. To deal with systems whose time issues become essential, different extensions of Petri nets with time have been proposed in the literature, each one being dependent on the application considered. In this paper, a new analysis technique for P-time Petri nets is proposed. It consists of simple operations on time intervals to determine a superset of behaviors of the modelled system. Then, once a desired behavior is extracted, thanks to a linear programming problem, its feasibility is verified via the existence of a solution.