Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata
No abstract available.
Related papers
- Timed Automata with Asynchronous Processes: Schedulability and Decidability TACAS 2002
- The Commutativity Problem of the MapReduce Framework: A Transducer-Based Approach CAV 2016
- The Decision Problem for Regular First Order Theories POPL 2025
- Even Simple Programs are Hard to Analyze POPL 1975
- Automata and fixpoints for asynchronous hyperproperties POPL 2021
- The first-order theory of subtyping constraints POPL 2002
- Context-Bounded Verification of Context-Free Specifications POPL 2023
- Symbolic Optimal Reachability in Weighted Timed Automata CAV 2016