Schedulability analysis of large-scale real-time systems with hierarchically profiled petri nets

In the classical literature, the analysis techniques for real-time does not cover the diverse and large tasks due to inconvenience for expressing tasks with timing constraints of the systems. In our prior work, we propose Hierarchically Profiled Petri Nets (HPPN). In this paper, we propose a schedulability analysis technique for complex and large real time systems using HPPN. This approach makes it possible to model and to analyze the system accurately.