TY - GEN
T1 - A proof system in PADS
AU - Yao, Xinghua
AU - Zhang, Min
AU - Chen, Yixiang
PY - 2013
Y1 - 2013
N2 - The PADS (Process Algebra for Demand and Supply) framework is an approach to model resource demand and supply for the formal analysis of hierarchical scheduling. Inspired by the demand relation in PADS, we propose a weak demand relation covering several cases which can not be described by a demand relation. And we explore some properties of weak demand relation which are similar to properties of demand relation. Especially, if two tasks are in a weak demand relation then their schedulabilities are closely related. Furthermore, we present a proof system for the weak demand relation in a decomposing-composing way, which helps to compare two tasks' schedulabilities. Finally, we prove that the proof system is sound and complete with respect to the semantic definition of weak demand relation.
AB - The PADS (Process Algebra for Demand and Supply) framework is an approach to model resource demand and supply for the formal analysis of hierarchical scheduling. Inspired by the demand relation in PADS, we propose a weak demand relation covering several cases which can not be described by a demand relation. And we explore some properties of weak demand relation which are similar to properties of demand relation. Especially, if two tasks are in a weak demand relation then their schedulabilities are closely related. Furthermore, we present a proof system for the weak demand relation in a decomposing-composing way, which helps to compare two tasks' schedulabilities. Finally, we prove that the proof system is sound and complete with respect to the semantic definition of weak demand relation.
KW - demand relation
KW - hierarchical scheduling
KW - real-time process algebra
KW - resource demand and resource supply
UR - https://www.scopus.com/pages/publications/84885005578
U2 - 10.1007/978-3-642-39718-9_23
DO - 10.1007/978-3-642-39718-9_23
M3 - 会议稿件
AN - SCOPUS:84885005578
SN - 9783642397172
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 391
EP - 408
BT - Theoretical Aspects of Computing, ICTAC 2013 - 10th International Colloquium, Proceedings
PB - Springer Verlag
T2 - 10th International Colloquium on Theoretical Aspects of Computing, ICTAC 2013
Y2 - 4 September 2013 through 6 September 2013
ER -