Data-flow Availability: Achieving Timing Assurance in Autonomous Systems
Ao Li, Ning Zhang
Abstract
Due to the continuous interaction with the physical world, autonomous cyber-physical systems (CPS) require both functional and temporal correctness. Despite recent advances in the theoretical foundation of real-time computing, leveraging these results efficiently in modern CPS platforms often requires domain expertise, and presents non-trivial challenges to many developers.
To understand the practical challenges in building real-time software, we conducted a survey of 189 software issues from 7 representative CPS open-source projects. Through this exercise, we found that most bugs are due to misalignment in time between cyber and physical states. This inspires us to abstract three key temporal properties: freshness, consistency, and stability. Using a newly developed concept, Data-flow Availability (DFA), which aims to capture temporal/availability expectation of data flow, we show how these essential properties can be represented as timing constraints on data flows. To realize the timing assurance from DFA, we designed and implemented Kairos, which automatically detects and mitigates timing constraint violations. To detect violations, Kairos translates the policy definition from the API-based annotations into run-time program instrumentation. To mitigate the violations, it provides an infrastructure to bridge semantic gaps between schedulers at different abstraction layers to allow for coordinated efforts. End-to-end evaluation on three real-world CPS platforms shows that Kairos improves timing predictability and safety while introducing a minimal 2.8% run-time overhead.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f6dc511e-5903-487f-b1fc-41d519ac4c03Cited by top-tier papers2
- KeepON: Supporting Deterministic Traffic on Standard NICsChuanyu Xue, Tianyu Zhang, Andrew Loveless, Song HanNSDI 2026 · 1 citation
- Software Availability Protection in Cyber-Physical SystemsAo Li, Jinwen Wang, Ning ZhangUSENIX Security 2025
Builds on8
- The nanoPU: A Nanosecond Network Stack for DatacentersStephen Ibanez, Alex Mallery, Serhat Arslan, Theo Jepsen et al.OSDI 2021 · 74 citations
- RT-TEE: Real-time System Availability for Cyber-physical Systems using ARM TrustZoneJinwen Wang, Ao Li, Haoran Li, Chenyang Lu et al.S&P 2022 · 69 citations
- ghOSt: Fast & Flexible User-Space Delegation of Linux SchedulingJack Tigar Humphries, Neel Natu, Ashwin Chaugule, Ofir Weisse et al.SOSP 2021 · 60 citations
- D3: a dynamic deadline-driven approach for building autonomous vehiclesIonel Gog, Sukrit Kalra, Peter Schafhalter, Joseph E. Gonzalez et al.EuroSys 2022 · 39 citations
- Syrup: User-Defined Scheduling Across the StackKostis Kaffes, Jack Tigar Humphries, David Mazières, Christos KozyrakisSOSP 2021 · 35 citations
Related papers
- Opportunistic Data Flow Integrity for Real-time Cyber-physical Systems Using Worst Case Execution Time ReservationYujie Wang, Ao Li, Jinwen Wang, Sanjoy K. Baruah et al.USENIX Security 2024 · 8 citations
- ARI: Attestation of Real-time Mission Execution IntegrityJinwen Wang, Yujie Wang, Ao Li, Yang Xiao et al.USENIX Security 2023
- Response-Time Analysis and Optimization for Probabilistic Conditional Parallel DAG TasksNiklas Ueter, Mario Günzel, Jian-Jia ChenRTSS 2021 · 13 citations
- Scenario-Based Flexible Modeling and Scalable Falsification for Reconfigurable CPSsJiawan Wang, Wenxia Liu, Muzimiao Zhang, Jiaqi Wei et al.CAV 2024 · 3 citations
- Virtual timeline: a formal abstraction for verifying preemptive schedulers with temporal isolationMengqi Liu, Lionel Rieg, Zhong Shao, Ronghui Gu et al.POPL 2020 · 17 citations
