时间约束Petri网(Ti ming Constraints Petri nets,简称TCPNs)是一类重要的时间Petri网系统。针对TCPNs中变迁可调度原始语义的不足,本文对相关定义重新定义,丰富并完善了TPCNs理论。本文首先给出了新的针对单个变迁或变迁序列的可调度...时间约束Petri网(Ti ming Constraints Petri nets,简称TCPNs)是一类重要的时间Petri网系统。针对TCPNs中变迁可调度原始语义的不足,本文对相关定义重新定义,丰富并完善了TPCNs理论。本文首先给出了新的针对单个变迁或变迁序列的可调度分析策略。如果一个特定的变迁序列是可调度的,则相应的活动序列也同样可以顺利地完成自身的执行;否则,不可调度的变迁需要调整自己的时间约束;然后提出了组合式的可调度分析策略以分析复杂变迁序列,最后提出时序一致性的概念。展开更多
The fact that outburst traffic in industrial Ethemet was focused on that would bring self-similar phenomenon leading to the delay increase of the cyclical data, and a hybrid priority queue schedule model was proposed ...The fact that outburst traffic in industrial Ethemet was focused on that would bring self-similar phenomenon leading to the delay increase of the cyclical data, and a hybrid priority queue schedule model was proposed in which the outburst data was given the highest priority. Some properties of the self-similar outburst data were proved by network calculus, and its service curve scheduled by the switch was gained. And then the performance of the scheduling algorithm was obtained. The simulation results are close to those calculated by using network calculus model. Some results are of actual significance to the construction of switched industrial Ethernet.展开更多
文摘时间约束Petri网(Ti ming Constraints Petri nets,简称TCPNs)是一类重要的时间Petri网系统。针对TCPNs中变迁可调度原始语义的不足,本文对相关定义重新定义,丰富并完善了TPCNs理论。本文首先给出了新的针对单个变迁或变迁序列的可调度分析策略。如果一个特定的变迁序列是可调度的,则相应的活动序列也同样可以顺利地完成自身的执行;否则,不可调度的变迁需要调整自己的时间约束;然后提出了组合式的可调度分析策略以分析复杂变迁序列,最后提出时序一致性的概念。
基金Project( 60425310) supported by the National Science Fund for Distinguished Young Scholars of ChinaProject(05JJ40118) supported by the Natural Science Foundation of Hunan Province, China
文摘The fact that outburst traffic in industrial Ethemet was focused on that would bring self-similar phenomenon leading to the delay increase of the cyclical data, and a hybrid priority queue schedule model was proposed in which the outburst data was given the highest priority. Some properties of the self-similar outburst data were proved by network calculus, and its service curve scheduled by the switch was gained. And then the performance of the scheduling algorithm was obtained. The simulation results are close to those calculated by using network calculus model. Some results are of actual significance to the construction of switched industrial Ethernet.
