You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.
The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.
For the reports in this repository we specifically note that
By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.
If you are in doubt, feel free to contact email@example.com
Cyber-physical systems (CPS) are physical and engineered systems whose operations are controlled, coordinated and monitored, by (mostly) resource-constrained computing and communication elements. Applications of CPS can be found in diverse, yet critical, areas like transportation, critical infrastructures, healthcare and industrial control. Many applications in the CPS domain have components of mixed criticalities which possess real-time requirements, and need schedulability validation. The literature of scheduling algorithms commonly relies on sufficient tests to determine if a set of mixed-criticality tasks is schedulable on a single processor. The drawback of these safe tests is their pessimism, a matter that could be solved if an exact schedulability analysis is used. This talk is spent to an algorithm for exact worst-case response time characterization of mixed-criticality sporadic real-time tasks executing according to a given fixed-priority scheduler. We also discuss an interesting result that if an exact schedulability test is used, the Audsley’s optimal priority assignment algorithm is not applicable to the mixed-criticality case. A feasibility interval for some specific setup of the system model is also provided.