By Topic

Schedulability analysis of real-time systems using timing constraint Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
J. J. P. Tsai ; Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA ; S. J. H. Yang ; Y. -H. Chang

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

Published in:

CompEuro '93. 'Computers in Design, Manufacturing, and Production', Proceedings.

Date of Conference:

24-27 May 1993