In: LNCS 2127: Parallel Computing Technologies, pages 128-pp. 6th International Conference, PaCT 2001, Novosibirsk, Russia, September 3-7, 2001, Proceeding / V. Malyshkin (Ed.) --- Springer Verlag, 2001.
Abstract: The paper aims at extending the categorical approach to Petri net based models with time constraints. We define a category of net processes with dense time, and use the general framework of open maps to obtain a notion of bisimulation. We show this to be equivalent to the standard notion of timed bisimulation. Next, decidability of timed bisimulation is shown in the setting of finite net processes. Further, the result on decidability is applied to time safe Petri nets, using a timed version of the McMillan-unfolding.