Paper Info
Title
A Proof System in Process Algebra for Demand and Supply
Abstract
Process Algebra for Demand and Supply (shortly, PADS), proposed by Philippou et al., is a process algebra model for the formal analysis of hierarchical scheduling. They introduce a basic notion of supply simulation relation to characterize task's schedulability. In this paper, we first investigate some properties of supply simulation relation. And then based on these properties, we present a proof system for the supply simulation relation in a decomposing-composing way and prove its soundness and completeness with respect to the semantic definition of a supply simulation relation. The soundness and completeness guarantee that the proof system is used to determine whether a task is schedulable by a supply or not.
Year
DOI
Venue
2014
10.1109/SERE-C.2014.44
SERE (Companion)
Keywords
Field
DocType
process algebra for supply and demand,scheduling,scheduling analysis,hierarchical scheduling formal analysis,supply simulation relation,pads,task schedulability,process algebra model,proof system,theorem proving,process algebra for supply and demand, scheduling analysis, proof system, supply simulation relation,process algebra for demand and supply,embedded systems,process algebra
Scheduling (computing),Work in process,Computer science,Theoretical computer science,Soundness,Supply and demand,Process calculus,Completeness (statistics)
Conference
Citations 
PageRank 
References 
0
0.34
8
Authors
2
Name
Order
Citations
PageRank
Xinghua Yao100.34
Yixiang Chen272.53