Abstract
The reachability problem of a marked graph (MG), an important subclass of Petri net, is extended to that of a time marked graph (TMG), in which each transition has a processing time to reflect a time dependency of a real dynamical system. Notions of stationary and transient markings are newly defined to describe this problem strictly, and necessary and sufficient conditions for the reachability of TMG are derived by transforming this problem to an equivalent submarking reachability problem. An executing algorithm for the firing sequence is also shown with an illustrating example.
