DocumentCode
1843560
Title
Schedulability analysis of real-time systems using timing constraint Petri nets
Author
Tsai, Jeffrey J P ; Yang, Steve J H ; Chang, Yao-Hsiung
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA
fYear
1993
fDate
24-27 May 1993
Firstpage
375
Lastpage
382
Abstract
Timing constraint Petri nets (TCPNs) to facilitate the modeling and analysis of real-time systems are presented. The schedulability analysis capabilities of TCPNs are discussed. Through modeling, analysis, and iterative refinement, the software developer can verify whether an underlying specification will be schedulable with respect to the given timing requirements, all via the token game played in TCPNs. The schedulability of real-time systems against the imposed timing constraints is analyzed
Keywords
Petri nets; real-time systems; scheduling; software engineering; iterative refinement; modeling; real-time systems; schedulability analysis; timing constraint Petri nets; timing constraints; Performance analysis; Petri nets; Processor scheduling; Real time systems; Timing; Usability;
fLanguage
English
Publisher
ieee
Conference_Titel
CompEuro '93. 'Computers in Design, Manufacturing, and Production', Proceedings.
Conference_Location
Pris-Evry
Print_ISBN
0-8186-4030-8
Type
conf
DOI
10.1109/CMPEUR.1993.289850
Filename
289850
Link To Document