TCPN的变迁弱规则特有的调度可达决策区域及算法
On Scheduling Reachability Decision Domain for Timing Constraint Petri Nets with Weak Firing Mode
-
摘要: 针对时间限制Petri网(TCPN)采用的变迁弱激活规则和基于TCPN的动态标记, 引入变迁的调度延时决策变量和决策空间概念刻画TCPN的状态可达可调度规律.这些概 念及其算法揭示了TCPN网的并发分布式动态调度特征.特别是变迁弱规则固有的容许含 有失败变迁的并行分布式调度问题,描述了涉及具有有效期的可释放资源类实时系统的特殊 调度问题及其规律.
-
关键词:
- Petri网 /
- 时间限制Petri网 /
- 变迁激活弱规则 /
- 并行分布式调度
Abstract: By introducing concepts of the scheduling-decision-variable and decision space and on the basis of the dynamic-marking for TCPN, this paper presents a calculation method for firable and schedulable decision domain of the transitions, which lead to a target mark. Besides, a transition will last for a period of time, so it is not certain that its firing can be completed successfully even if the transition has been fired. Thus the reaching possibility of an expected target may also depend on the failure or extermination of other transitions. Therefore, those failing transitions should be considered when we deal with schedulability analysis and system synthesis of TCPN. TCPN with weak firing mode can be used to manage dynamic scheduling of concurrent and distributed real-time control systems with deadline and releasable resources.
计量
- 文章访问数: 2344
- HTML全文浏览量: 105
- PDF下载量: 1075
- 被引次数: 0