Time Analysis of Scheduling Sequences Based on Petri Nets for Distributed Real-Time Embedded Systems

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.