Paper Info
Title
A Proof System in PADS.
Abstract
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. © 2013 Springer-Verlag Berlin Heidelberg.
Year
DOI
Venue
2013
10.1007/978-3-642-39718-9-23
ICTAC
Keywords
DocType
Volume
demand relation,hierarchical scheduling,real-time process algebra,resource demand and resource supply
Conference
8049 LNCS
Issue
ISSN
Citations 
null
16113349
0
PageRank 
References 
Authors
0.34
10
3
Name
Order
Citations
PageRank
Xinghua Yao101.35
Min Zhang213438.40
Yixiang Chen302.03