| 本文已被：浏览 5589次 下载 8557次 |
码上扫一扫！ |
|
|
| 时间约束Petri网及其可调度性分析与验证 |
|
宋巍1,2, 窦万春1,2, 刘茜萍1,2
|
|
1.南京大学,计算机科学与技术系,江苏,南京,210093;2.计算机软件新技术国家重点实验室(南京大学),江苏,南京,210093
|
|
| 摘要: |
| 时间约束Petri网(timing constraint Petri nets,简称TCPN)是一类重要的时间Petri网系统.对相关定义重新界定,丰富并完善了TCPN理论.针对变迁可调度原始定义的不足,首先给出了变迁的弱/强可调度的新定义及强可调度判定定理;然后对变迁的强可调度进行了拓展,提出了TCPN时间可调度的概念,并结合Petri网结构给出了TCPN时间可调度判定定理;最后对TCPN的相关特性进行了研究.TCPN对时间Petri网的研究工作将起到启发作用,并对实时系统的描述和建模工作具有一定的参考价值. |
| 关键词: 时间相关Petri网 TCPN 弱可调度 强可调度 可调度性分析 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Natural Science Foundation of China under Grant Nos.60303025, 60673017 (国家自然科学基金); the Jiangsu Provincial NSF Research Funds under Grant Nos.BK2004411, BK2005208 (江苏省基础研究计划) |
|
| Timing Constraint Petri Nets and Their Schedulability Analysis and Verification |
|
SONG Wei,DOU Wan-Chun,LIU Xi-Ping
|
| Abstract: |
| TCPN (timing constraint Petri nets) is an important kind of time-related Petri nets. Some basic concepts are redefined to enrich and perfect corresponding the theory of TCPN. Firstly, the rigorous definitions for weak and strong schedulability of a transition are redefined to correct the irrationality of the original ones. The verification method for the strong schedulability is presented in the form of a theorem. Secondly, the definition of schedulability of TCPN is given and the corresponding necessary and sufficient condition is proposed. Finally, the characteristic of TCPN along with Petri nets and other time-related Petri nets is analysed. It is of certain illumination and referrence, both in research of time-related Petri nets and in modeling real-time systems. |
| Key words: time-related Petri nets TCPN (timing constraint Petri nets) weak schedulability strong schedulability schedulability analysis |
