Reachability analysis for time Petri nets without overlappings of firing intervals

This paper discusses a subclass of Merlin’s time Petri nets called here time Petri nets without overlappings of firing intervals. In addition to the existing enumerative procedure for time nets, a new technique of reachability analysis for nets in the subclass is presented. Correctness of the presented method is proved. The sufficient condition of the boundedness property is formulated.