Add to ORKGThis paper deals with computing the minimal and maximal execution durations in a given concurrent system in order to support software dependability engineering by assuring the meeting of prescribed deadlines. For that purpose, a new kind of time-dependent Petri nets - the Duration Interval Petri net - is introduced, and a dedicated reachability graph is defined in a discrete way. Using this reachability graph, shortest and largest time paths between two arbitrary states of the concurrent system, and by this way minimal and maximal software execution times, can be computed. These results have been applied to a medium-sized reactive system. (orig.)Available from TIB Hannover: RR 8073(1996,2) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...