The temporal correctness of safety-critical systems is typically guaranteed via a response-time analysis (RTA). However, as the systems become complex (e.g., parallel tasks running on a multicore platform), most existing RTAs either become pessimistic or do not scale with respect to e.g., the number of tasks or period values. To make a trade-off between accuracy and scalability, recently, a new reachability-based RTA called schedule-abstraction graph (SAG) has been introduced by Nasri et al. It explores the space of possible decisions that a scheduling policy can take while dispatching a set of tasks or jobs on processing resources. The analysis is at least three orders of magnitude faster than other exact RTAs and is able to identify many more schedulable task sets than the existing fixed-point iteration-based analyses. One fundamental limitation of the SAG analysis is that in its reachability graph, each edge can only account for a single scheduling decision. Therefore, the graph grows exponentially when there are large uncertainties in the release time or execution time of the jobs. In this paper, we improve the scalability of the SAG analysis by introducing partial-order reduction (POR) rules that allow combining multiple scheduling decisions on one edge and hence avoiding combinatorial exploration of all possible scheduling decisions. An empirical evaluation shows that our solution is able to reduce the runtime by five orders of magnitude and the number of explored states by 98%.

Partial-Order Reduction in Reachability-based Response-Time Analyses

The secure functioning of automotive systems is vital to the safety of their passengers and other roadway users. One of the critical functions for safety is the controller area network (CAN), which interconnects the safety-critical electronic control units (ECUs) in the majority of ground vehicles. Unfortunately CAN is known to be vulnerable to several attacks. One such attack is the bus-off attack, which can be used to cause a victim ECU to disconnect itself from the CAN bus and, subsequently, for an attacker to masquerade as that ECU. A limitation of the bus-off attack is that it requires the attacker to achieve tight synchronization between the transmission of the victim and the attacker's injected message. In this paper, we introduce a schedule-based attack framework for the CAN bus-off attack that uses the real-time schedule of the CAN bus to predict more attack opportunities than previously known. We describe a ranking method for an attacker to select and optimize its attack injections with respect to criteria such as attack success rate, bus perturbation, or attack latency. The results show that vulnerabilities of the CAN bus can be enhanced by schedule-based attacks.

Vulnerability of Controller Area Network to Schedule-Based Attacks

**Session chairs:** Hoon Sung Chwa	and	Federico Terraneo

- 5 min: [**(WaP) Linear-time admission control for elastic scheduling**](https://tu-dortmund.sciebo.de/s/6MZ1StUhCvN00pl), *Marion Sudvarg, Chris Gill and Sanjoy Baruah*
- 5 min: [**(WiP) Automatically Generated Response-Time Proofs as Evidence of Timeliness**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a512/280200a512.pdf), *Marco Maida, Sergey Bozhko and Björn Brandenburg*
- 5 min: [**(WiP) Evaluation Framework for Self-Suspending Schedulability Tests**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a532/280200a532.pdf), *Mario Guenzel, Harun Teper, Kuan-Hsun Chen, Georg von der Brüggen and Jian-Jia Chen*
- 5 min: [**(WiP) Partial-Order Reduction in Reachability-based Response-Time Analyses**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a544/280200a544.pdf), *Sayra Ranjha, Mitra Nasri and Geoffrey Nelissen*
- 5 min: [**(WiP) Run-time pWCET estimation and quality monitoring**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a552/280200a552.pdf), *Federico Reghenzani, Filippo Sciamanna and William Fornaciari*
- 5 min: [**(WiP) Worst-Case Response Time of Intersection Management Protocols**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a556/280200a556.pdf), *Radha Reddy, Luís Almeida, Miguel Gaitan, Harrison Kurunathan, Pedro Santos and Eduardo Tovar*
- 5 min: [**(WiP) Analysis of TSN Time-aware Shapers using Schedule Abstraction Graphs**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a508/280200a508.pdf), *Srinidhi Srinivasan, Geoffrey Nelissen and Reinder J. Bril*
- 5 min: **(RTSS@Work) Demonstrating RA-TDMAs+ for robust communication in WiFi mesh networks**, *Diogo Almeida, Miguel Gutiérrez Gaitán, Pedro M. d'Orey, Pedro M. Santos, Luı́s Pinto and Luı́s Almeida*

2.12 - Brief Presentations and RTSS@Work

technical paper

 **RTSS 2021** has successfully concluded. Hope you have enjoyed it, and look forward to seeing you next year in person.
    Announcement for the Awards:
 * Best Paper Award goes to: Monte Carlo Response-Time Analysis, Sergey Bozhko, Georg von der Brüggen, and Björn Brandenburg
 * Best Student Paper Award goes to: Automatic Energy-Hotspot Detection and Elimination in Real-Time Deeply Embedded Systems, Mohsen Shekarisaz, Lothar Thiele, and Mehdi Kargahi.
 * Best Solution Award for Industry Session goes to: Toward Real-Time Guaranteed Scheduling for Autonomous Driving Systems. Jinghao Sun, Tianyi Wang, Kailu Duan, Bin Lu, Jiankang Ren, Zhishan Guo, and Guozhen Tan.



IEEE RTSS 2021

The IEEE Real-Time Systems Symposium (RTSS) is the premier conference in the field of real-time systems, and is a venue for researchers and practitioners to showcase innovations covering all aspects of real-time systems, including theory, design, analysis, implementation, evaluation, and experience. 

**Session chair:** Luis Almeida

- 25 min: [**Vulnerability of Controller Area Network to Schedule-Based Attacks**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a495/280200a495.pdf), *Sena Hounsinou, Mark Stidd, Uchenna Ezeobi, Habeeb Olufowobi, Mitra Nasri and Gedare Bloom*
- 25 min: [**AegisDNN: Dependable and Timely Execution of DNN Tasks with SGX**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a068/280200a068.pdf), *Yecheng Xiang, Yidi Wang, Hyunjong Choi, Mohsen Karimi and Hyoseung Kim*
- 25 min: [**Event-Triggered and Time-Triggered Duration Calculus for Model-Free Reinforcement Learning (Artifact Evaluated)**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a240/280200a240.pdf), *Kalyani Dole, John Komp, Ashutosh Gupta, Krishna S. and Ashutosh Trivedi*
- 5 min: [**(WiP) Enabling Secure Boot for Real-Time Restart-Based Cyber-Physical Systems**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a524/280200a524.pdf), *Sena Hounsinou, Vijay Kumar Banerjee, Chunhao Peng, Monowar Hasan and Gedare Bloom*
- 5 min: [**(WiP) Improving Resilience of Distributed Real-Time Applications via Security and Fault Tolerance Co-Design**](https://conferences.computer.org/rtsspub/pdfs/RTSS2021-23beZleJJDdiozCiQ9rzXD/280200a536/280200a536.pdf), *Wei Jiang, Xinke Liao, Jinyu Zhan and Ke Jiang*



Mitra Nasri

2

2

SHORT BIO

Presentations

Partial-Order Reduction in Reachability-based Response-Time Analyses

Vulnerability of Controller Area Network to Schedule-Based Attacks

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES