Modeling and Analysis of Scheduling for Distributed Real-time Embedded Systems

Aimed at the deficiencies of resources based time Petri nets (RBTPN) in doing scheduling analysis for distributed real-time embedded systems,the assemblage condition of complex scheduling sequences is presented to easily compute scheduling length and simplify scheduling analysis.Based on this,a new hierarchical RBTPN model is proposed.The model introduces the definition of transition border set,and represents it as an abstract transition.The abstract transition possesses all resources of the set,and has the highest priority of each resource;the execution time of abstract transition is the longest time of all possible scheduling sequences.According to the characteristics and assemblage condition of RBTPN,the refinement conditions of transition border set are given,and the conditions ensure the correction of scheduling analysis.As a result,it is easy for us to understand the scheduling model and perform scheduling analysis.