Mealy机的实时系统调度方法  

Real-Time Scheduling Method Based on Mealy Machine

作　　者：汲洋弘康 王飞[1] 余婷[1] 

机构地区：[1]华侨大学信息科学与工程学院,福建厦门361021

出　　处：《华侨大学学报（自然科学版）》2014年第5期503-508,共6页Journal of Huaqiao University(Natural Science)

基　　金：国家自然科学基金资助项目(61203040);福建省自然科学基金资助项目(2011J01352)

摘　　要：为得到实时并发系统的最优运行路径,提出一种基于Mealy机建模的最优调度方法.通过分析以Ptime Petri网建模的实时系统,并用Mealy机建立中库所及其对应时间的关系,得到在满足系统非死锁、非阻塞特性下的最优路径.基于这种方法,可获得P-time Petri网的最优合法序列.通过实例验证表明:所提出的方法具有较好的效果.In this paper,in order to get the optimal path of real-time concurrent systems,an optimal scheduling method based on Mealy machine was proposed.Through analyzing on the real-time system with P-time Petri nets model and modeling the relationship between the place and its corresponding time with Mealy machine,the optimal path satisfied with non-deadlock and non-blocking was obtained.Based on this method,the optimal legal firing sequence of P-time Petri nets can be obtained,experimental results show that,the proposed method has a good effect.

关 键 词：实时系统 MEALY机 P-time PETRI网 调度分析 

分 类 号：TP271.8[自动化与计算机技术—检测技术与自动化装置]