TR 87-09, Dept. of EECS, University of Wisconsin-Milwaukee, 1987.
Also in: IEEE Transactions on Computers, Vol. 38, No. 2, pages 696-704. May 1989.
Abstract: A new class of Petri nets is introduced, called temporal Petri nets, in which timing constraints are represented by operaors of temporal logic. Due to the versatility of temporal operators to express temporal assertions, temporal Petri nets can describe clearly and compactly caulsal and temporal relationships between the events of a system, including eventuality and fairness.