[1]汲洋弘康,王飞,余婷.Mealy机的实时系统调度方法[J].华侨大学学报(自然科学版),2015,36(预先出版):0.
　JI Yang-hong-kang,WANG Fei,YU Ting.Real-Time Scheduling Method Based on Mealy Machine[J].Journal of Huaqiao University(Natural Science),2015,36(预先出版):0.
点击复制

Mealy机的实时系统调度方法
分享到：

《华侨大学学报（自然科学版）》[ISSN:1000-5013/CN:35-1079/N]

卷:
第36卷
期数:
2015年预先出版
页码:
0
栏目:
出版日期:
2027-07-30

文章信息/Info

Title:
Real-Time Scheduling Method Based on Mealy Machine
作者:
汲洋弘康;  王飞;  余婷
华侨大学 信息科学与工程学院, 福建 厦门 361021
Author(s):
JI Yang-hong-kang;  WANG Fei;  YU Ting
College of Information Science and Engineering, Huaqiao University, Xiamen 361021, China
关键词:
实时系统;  Mealy机;  P-time Petri网;  调度分析
Keywords:
real-time system;  mealy machine;  P-time Petri nets;  scheduling analysis
分类号:
TP271.8
文献标志码:
A
摘要:
为得到实时并发系统的最优运行路径,提出一种基于Mealy机建模的最优调度方法.通过分析以P-time Petri网建模的实时系统,并用Mealy机建立中库所及其对应时间的关系,得到在满足系统非死锁、非阻塞特性下的最优路径.基于这种方法,可获得P-time Petri网的最优合法序列.通过实例验证表明,所提出的方法具有较好的效果.
Abstract:
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, experiments show that, the proposed method has a good effect.

参考文献/References:

[1] LIU C L,LAYLAND J W.Scheduling algorithms for multiprogramming in a hard real-time environment [J].Journal of the ACM,1973,20(1):46-61.
[2] KAMALA KRITHIVASAN R R.形式语言,自动机理论与计算导论[M].孟宇龙,等译.北京:电子工业出版社,2012:42-77.
[3] 王柏.形式语言与自动机[M].北京:北京邮电大学出版社,2003:23-55.
[4] TAREK A,LOPEZ-BENITEZ N.Optimal legal firing sequence of Petri nets using linear programming[J].Optimization and Engineering,2004,5(1):25-43.
[5] 苏国军,汪雄海.半导体制造系统改进 Petri 网模型的建立及优化调度[J].系统工程理论与实践,2011,31(7): 1372-1377.
[6] 邵志芳,刘仲英,钱省三.整合 Petri 网和蚁群优化算法用于柔性制造系统调度优化研究[J].计算机应用,2006,26(11):2753-2755.
[7] BONHOMME P.Scheduling and control of real-time systems based on a token player approach[J].Discrete Event Dynamic Systems,2013,23(2):197-209.
[8] 苏海洋.Petri 网络径寻优[D].西安:西安建筑科技大学,2007:15-31.
[9] CASSEZ F,ROUX O H.From time Petri nets to timed automata[J].Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach,2006(1):51-62.
[10] MERLIN P,FARBER D.Recoverability of communication protocols-implications of a theoretical study[J].IEEE Transactions on Communications,1976,24(9):1036-1043.
[11] CASSANDRAS C G,LAFORTUNE S.Introduction to discrete event systems[M].Berlin:Springer,2008:40-42,224-230.
[12] 吴哲辉.Petri网导论[M].北京:机械工业出版社,2006:27-29.

相似文献/References:

[1]汲洋弘康,王飞,余婷.Mealy机的实时系统调度方法[J].华侨大学学报(自然科学版),2014,35(5):503.[doi:10.11830/ISSN.1000-5013.2014.05.0503]
　JI Yang-hong-kang,WANG Fei,YU Ting.Real-Time Scheduling Method Based on Mealy Machine[J].Journal of Huaqiao University(Natural Science),2014,35(预先出版):503.[doi:10.11830/ISSN.1000-5013.2014.05.0503]

备注/Memo

备注/Memo:
收稿日期: 2013-11-02
通信作者: 王飞(1977-),男,副教授,主要从事离散事件系统、资源优化配置的研究.E-mail:feiw545@163.com.
基金项目: 国家自然科学基金资助项目(61203040); 福建省自然科学基金资助项目(2011J01352)
更新日期/Last Update: 1900-01-01