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

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. >