| 时间约束Petri网及其可调度性分析与验证 |
| |
| 引用本文： | 宋巍,窦万春,刘茜萍.时间约束Petri网及其可调度性分析与验证[J].软件学报,2007,18(1):11-21. |
| |
| 作者姓名： | 宋巍 窦万春 刘茜萍 |
| |
| 作者单位： | 南京大学,计算机科学与技术系,江苏,南京,210093;计算机软件新技术国家重点实验室(南京大学),江苏,南京,210093 |
| |
| 基金项目： | 国家自然科学基金;江苏省应用基础研究计划项目 |
| |
| 摘 要： | 时间约束Petri网(timing constraint Petri nets,简称TCPN)是一类重要的时间Petri网系统.对相关定义重新界定,丰富并完善了TCPN理论.针对变迁可调度原始定义的不足,首先给出了变迁的弱/强可调度的新定义及强可调度判定定理;然后对变迁的强可调度进行了拓展,提出了TCPN时间可调度的概念,并结合Petri网结构给出了TCPN时间可调度判定定理;最后对TCPN的相关特性进行了研究.TCPN对时间Petri网的研究工作将起到启发作用,并对实时系统的描述和建模工作具有一定的参考价值.
|
| 关 键 词： | 时间相关Petri网 弱可调度 强可调度 可调度性分析 |
| 收稿时间： | 2005-12-09 |
| 修稿时间： | 4/3/2006 12:00:00 AM |
Timing Constraint Petri Nets and Their Schedulability Analysis and Verification |
| |
| SONG Wei,DOU Wan-Chun and LIU Xi-Ping.Timing Constraint Petri Nets and Their Schedulability Analysis and Verification[J].Journal of Software,2007,18(1):11-21. |
| |
| Authors: | SONG Wei DOU Wan-Chun and LIU Xi-Ping |
| |
| Affiliation: | 1.Department of Computer Science and Technology, Nanjing University, Nanjing 210093, China; 2.State Key Laboratory for Novel Software Technology (Nanjing University |
| |
| 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. |
| |
| Keywords: | TCPN |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
