In: Theoretical Computer Science, Vol. 243, No. 1-2, pages 1-34. 2000.
Abstract: Processes of timed Petri nets are represented by labeled partial orders with some extra features. These features reflect the execution times of processes and allow to combine processes sequentially and in parallel, which leads to some algebras. The processes can be represented either without specifying when particular situations appear (free processes), or together with the respective appearance times (timed processes). The processes of the latter type determine the possible firing sequences of the respective nets.
Keywords: labeled partial orders, net processes, process algebras, timed Petri nets.