科研之友
微信
新浪微博
Facebook
分享链接
摘要
PADS (Process Algebra for Demand and Supply) is a formal framework to analyze hierarchical scheduling in real-Time embedded systems. Inspired by the supply simulation relation in PADS, we introduce a partial supply simulation relation in order to describe the fact that an unschedulable task may finish on time. It is more general than the supply simulation relation. Then, we explore some properties of partial supply simulation relation. Furthermore, we establish a proof system for the partial supply simulation relation in a decomposing-composing way, which helps to infer tasks'partial schedulabilities. Finally, it is proved that the proof system is sound and complete with respect to the semantic definition of partial supply simulation relation.
