An enumerative approach for time Petri nets (or Melin's model) analysis is presented. In this model, if a transition t is enabled at time /spl tau/, it can be fired at any time in the interval [/spl tau/+tmax(t)]. It is shown that the firing condition at the nth firing can be expressed by the means of the marking, the enabling point of enabled transitions, and the minimal and maximal elapsed time between to firings. This result leads to an attractive definition of state classes and allows a simple computation of reachable state classes. The approach presented has two main advantages. First, the computation of reachable state classes is more simple and does not require any solution of a system. Second, the graph obtained is a subgraph of that given by M. Menasche (1982).
展开▼
机译：提出了一种举行时间培养网（或MELIN模型）分析的枚举方法。在该模型中，如果在时间/ SPL TAU /时启用过渡T，则可以在间隔[/ SPL TAU / + TMAX（T）]中随时触发它。结果表明，第n个烧制的射击条件可以通过标记的装置，使能转换的启用点，以及到烧制之间的最小和最大时间。该结果导致状态类的有吸引力的定义，并且允许简单地计算到达状态类。呈现的方法具有两个主要优点。首先，可到达状态类的计算更简单，不需要系统的任何解决方案。其次，所获得的图表是由M. menasche（1982）给出的那个副本。
展开▼
