On Performance Bounds for interval Petri nets

Interval time Petri Nets are Petri nets in which time intervals are associated to transitions. Their quantitative analysis basically consists in applying enumerative techniques that suffer the well known state space explosion problem. To overcome this problem several methods have been proposed in the literature, that either allow to obtain equivalent nets with a reduced state space or avoid the construction of the whole state space. The alternative method proposed here consists in computing performance bounds to partially characterize the quantitative behavior of interval time Petri Nets by exploiting their structural properties and/or by applying operational laws. The performance bound computation is not a new technique: it has been proposed for timed Petri nets. In this paper we present the results obtained from a preliminary investigation on the applicability of bounding techniques of timed Petri nets to interval time Petri Nets.