DocumentCode :
3343816
Title :
Time Analysis of Scheduling Sequences Based on Petri Nets for Distributed Real-Time Embedded Systems
Author :
Zhang, Haitao ; Ai, Yunfeng
Author_Institution :
Inst. of Autom., Chinese Acad. of Sci., Beijing
fYear :
2006
fDate :
Aug. 2006
Firstpage :
1
Lastpage :
5
Abstract :
After modeling distributed embedded systems using time Petri nets based on resources, scheduling analysis is complex. Therefore, the combination and decomposition of scheduling sequences are introduced to simplify the analysis of complex scheduling sequences. Then two simplification rules are introduced to simplify the time constriction of every transition in scheduling sequence. At last, all properties of scheduling sequence can be gotten by comparing time constriction and deadline interval of every transition
Keywords :
Petri nets; distributed processing; embedded systems; scheduling; Petri nets; distributed real-time embedded systems; scheduling analysis; scheduling sequences; time analysis; Algorithm design and analysis; Embedded system; Formal languages; Intelligent systems; Laboratories; Neodymium; Petri nets; Real time systems; Scheduling algorithm; Strontium;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mechatronic and Embedded Systems and Applications, Proceedings of the 2nd IEEE/ASME International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-9721-5
Type :
conf
DOI :
10.1109/MESA.2006.296996
Filename :
4077823
Link To Document :
بازگشت