Tsai等提出了时间限制Petri网（TCPN），并讨论变迁可激活、可调度规律及其计算公式．然而，由于网拓扑和动态的复杂性，某些概念的逻辑关系及公式有矛盾．本文通过引入调度决策变量、动态标记准确地刻画调度规律，修正澄清了Tsai文中的问题，完善了TCPN的调度分析．另外，讨论了TCPN沿含有失败变迁激活路径的调度问题， Tsai et al. Proposed a time-limited Petri net (TCPN) and discussed the rules of activation, schedulability and their formulas. However, due to the complexity of the network topology and dynamics, some concepts have conflicting logic and formulas. In this paper, by introducing scheduling decision variables, the dynamic marking accurately describes the scheduling rules, amends and clarifies the problems in Tsai text, and improves the scheduling analysis of TCPN. In addition, we discuss the scheduling problem of TCPN along path containing activation failure,