A Partial Supply Simulation Relation and its Proof System in PADS

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 decomposingcomposing 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.

[1]  Thomas Nolte,et al.  Modelling, Verification and Synthesis of Two-Tier Hierarchical Fixed-Priority Preemptive Scheduling , 2011, 2011 23rd Euromicro Conference on Real-Time Systems.

[2]  Yixiang Chen,et al.  A Proof System in Process Algebra for Demand and Supply , 2014, 2014 IEEE Eighth International Conference on Software Security and Reliability-Companion.

[3]  Aloysius K. Mok,et al.  A model of hierarchical real-time virtual resources , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[4]  Enrico Vicario,et al.  Modeling flexible real time systems with preemptive time Petri nets , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[5]  Wang Yi,et al.  Task automata: Schedulability, decidability and undecidability , 2007, Inf. Comput..

[6]  Wang Yi,et al.  Timed Automata with Asynchronous Processes: Schedulability and Decidability , 2002, TACAS.

[7]  Insup Lee,et al.  PADS: An approach to modeling resource demand and supply for the formal analysis of hierarchical scheduling , 2012, Theor. Comput. Sci..

[8]  Thomas A. Henzinger,et al.  An Interface Algebra for Real-Time Components , 2006, 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06).

[9]  Insup Lee,et al.  Interface Algebra for Analysis of Hierarchical Real-Time Systems , 2008 .

[10]  Insup Lee,et al.  Compositional real-time scheduling framework , 2004, 25th IEEE International Real-Time Systems Symposium.

[11]  Insup Lee,et al.  A process algebraic approach to the specification and analysis of resource-bound real-time systems , 1994, Proc. IEEE.

[12]  Insup Lee,et al.  Resources in process algebra , 2007, J. Log. Algebraic Methods Program..

[13]  Duncan Clarke,et al.  A Process Algebraic Approach to the Schedulability Analysis of Real-Time Systems , 1998, Real-Time Systems.

[14]  Yixiang Chen,et al.  A Proof System in PADS , 2013, ICTAC.

[15]  Lothar Thiele,et al.  Real-time interfaces for composing real-time systems , 2006, EMSOFT '06.

[16]  Insup Lee,et al.  A process algebraic approach to the schedulability analysis and workload abstraction of hierarchical real-time systems , 2017, J. Log. Algebraic Methods Program..

[17]  Twan Basten,et al.  PARS: A Process Algebra with Resources and Schedulers , 2003, FORMATS.

[18]  Manuel Núñez,et al.  PAMR: A Process Algebra for the Management of Resources in Concurrent Systems , 2001, FORTE.