On the public citation graph
Weakly Hard Schedulability Analysis for Fixed Priority Scheduling of Periodic Real-Time Tasks
0 signed · 84 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s11241-006-9010-1openalex-snapshot
Sensitivity analysis for fixed-priority real-time systems
inferredcites →https://doi.org/10.1016/0166-5316(82)90024-4openalex-snapshot
On the complexity of fixed-priority scheduling of periodic, real-time tasks
inferredcites →https://doi.org/10.1016/s0898-1221(98)90205-xopenalex-snapshot
Hard real-time computing systems: Predictable scheduling algorithms and applications
inferredcites →https://doi.org/10.1023/b:time.0000045315.61234.1eopenalex-snapshot
Real Time Scheduling Theory: A Historical Perspective
inferredcites →https://doi.org/10.1109/12.477249openalex-snapshot
A dynamic priority assignment technique for streams with (m, k)-firm deadlines
inferredcites →https://doi.org/10.1109/12.57058openalex-snapshot
Priority inheritance protocols: an approach to real-time synchronization
inferredcites →https://doi.org/10.1109/71.774906openalex-snapshot
Overload management in real-time control applications using (m, k)-firm guarantee
inferredcites →https://doi.org/10.1109/aspdac.2011.5722188openalex-snapshot
Co-design of cyber-physical systems via controllers with flexible delay constraints
inferredcites →https://doi.org/10.1109/cdc.2001.914701openalex-snapshot
An introduction to control and scheduling co-design
inferredcites →https://doi.org/10.1109/ecrts.2015.29openalex-snapshot
Improved Deadline Miss Models for Real-Time Systems Using Typical Worst-Case Analysis
inferredcites →https://doi.org/10.1109/emrts.2002.1019196openalex-snapshot
Exact best-case response time analysis of fixed priority scheduled tasks
inferredcites →https://doi.org/10.1109/real.1990.128748openalex-snapshot
Fixed priority scheduling of periodic task sets with arbitrary deadlines
inferredcites →https://doi.org/10.1109/real.1993.393496openalex-snapshot
Scheduling slack time in fixed priority pre-emptive systems
inferredcites →https://doi.org/10.1109/real.2002.1181583openalex-snapshot
Stochastic analysis of periodic real-time systems
inferredcites →https://doi.org/10.1109/rtas.2015.7108440openalex-snapshot
Task placement and selection of data consistency mechanisms for real-time multicore applications
inferredcites →https://doi.org/10.1109/rtas.2015.7108445openalex-snapshot
Budgeted generalized rate monotonic analysis for the partitioned, yet globally scheduled uniprocessor model
inferredcites →https://doi.org/10.1109/rtas34971.2015openalex-snapshot
21st IEEE Real-Time and Embedded Technology and Applications Symposium
inferredcites →https://doi.org/10.1109/rtcsa.2015.23openalex-snapshot
Exploiting Job Response-Time Information in the Co-Design of Real-Time Control Systems
inferredcites →https://doi.org/10.1109/rtss.2012.67openalex-snapshot
Quantifying the Effect of Rare Timing Events with Settling-Time and Overshoot
inferredcites →https://doi.org/10.1109/rtss.2012.79openalex-snapshot
Designing High-Quality Embedded Control Systems with Guaranteed Stability
inferredcites →https://doi.org/10.1109/rtss.2014.28openalex-snapshot
Formal Analysis of Timing Effects on Closed-Loop Properties of Control Software
inferredcites →https://doi.org/10.1109/sies.2013.6601470openalex-snapshot
Efficient partitioning of sporadic real-time tasks with shared resources and spin locks
inferredcites →https://doi.org/10.1109/tcns.2016.2583064openalex-snapshot
Co-Design of Arbitrated Network Control Systems With Overrun Strategies
inferredcites →https://doi.org/10.1145/2502524.2502542openalex-snapshot
Co-design of control and platform with dropped signals
inferredcites →https://doi.org/10.1145/2516821.2516825openalex-snapshot
Best-case response times and jitter analysis of real-time tasks with arbitrary deadlines
inferredcites →https://doi.org/10.1145/2593458.2593467openalex-snapshot
Controller/platform co-design of networked control systems based on density functions
inferredcites →https://doi.org/10.1145/2656045.2656059openalex-snapshot
Extending typical worst-case analysis using response-time dependencies to bound deadline misses
inferredcites →https://doi.org/10.1145/2834848.2834860openalex-snapshot
Worst-case performance validation of safety-critical control systems with dropped samples
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.3182/20140824-6-za-1003.00289openalex-snapshot
Response Time Driven Design of Control Systems
inferredcites →https://doi.org/10.4271/2016-01-0017openalex-snapshot
Moving from Single-Core to Multicore: Initial Findings on a Fuel Injection Case Study
inferredcites →https://doi.org/10.5555/2492708.2492836openalex-snapshot
Formal analysis of sporadic overload in real-time systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-53288-8_26openalex-snapshot
SAW: A Tool for Safety Analysis of Weakly-Hard Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-60508-7_28openalex-snapshot
Efficient System Verification with Multiple Weakly-Hard Constraints for Runtime Monitoring
inferred← citeshttps://doi.org/10.1007/s11241-020-09344-1openalex-snapshot
Performance maximization of energy-variable self-powered (m, k)-firm real-time systems
inferred← citeshttps://doi.org/10.1016/j.micpro.2020.103110openalex-snapshot
Reliability-Aware Energy-Efficient Scheduling for (m, k)-Constrained Real-Time Systems Through Shared Time Slots
inferred← citeshttps://doi.org/10.1016/j.micpro.2020.103183openalex-snapshot
Resource-efficient cyber-physical systems design: A survey
inferred← citeshttps://doi.org/10.1016/j.micpro.2022.104517openalex-snapshot
State-based switching multi-rate controller for improving resource utilization on predictable and composable platforms
inferred← citeshttps://doi.org/10.1016/j.sysarc.2021.102150openalex-snapshot
Global emergency-based job-level scheduling for weakly-hard real-time systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2024.103185openalex-snapshot
Reliability-aware scheduling for ( m , k ) -firm real-time embedded systems under hard energy budget constraint
inferred← citeshttps://doi.org/10.1049/iet-cta.2018.6121openalex-snapshot
Adaptation in network control systems with hierarchical scheduling
inferred← citeshttps://doi.org/10.1088/1757-899x/884/1/012050openalex-snapshot
Performance comparison of partitioned and global approaches for weakly hard real-time systems
inferred← citeshttps://doi.org/10.1109/access.2020.3024698openalex-snapshot
Integer Programming Techniques for Static Scheduling of Hard Real-Time Systems
inferred← citeshttps://doi.org/10.1109/cisai54367.2021.00097openalex-snapshot
A Task Scheduling Algorithm for Minimizing Worst- Case Execution Time of Real-Time Embedded Systems
inferred← citeshttps://doi.org/10.1109/dsn69566.2026.00060openalex-snapshot
An (m, k)-firm Elevation Policy for Weakly Hard Real-Time in Converged 5G-TSN Networks
inferred← citeshttps://doi.org/10.1109/etfa.2018.8502621openalex-snapshot
Weakly-Hard Real-Time Guarantees for Weighted Round-Robin Scheduling of Real-Time Messages
inferred← citeshttps://doi.org/10.1109/iccd46524.2019.00035openalex-snapshot
Security-Driven Codesign with Weakly-Hard Constraints for Real-Time Embedded Systems
inferred← citeshttps://doi.org/10.1109/iccd50377.2020.00109openalex-snapshot
Chain-Based Fixed-Priority Scheduling of Loosely-Dependent Tasks
inferred← citeshttps://doi.org/10.1109/iccps61052.2024.00016openalex-snapshot
Quantitative Safety-Driven Co-Synthesis of Cyber-Physical System Implementations
inferred← citeshttps://doi.org/10.1109/jiot.2021.3058215openalex-snapshot
Toward Practical Weakly Hard Real-Time Systems: A Job-Class-Level Scheduling Approach
inferred← citeshttps://doi.org/10.1109/rtas.2019.00027openalex-snapshot
Improving a Compositional Timing Analysis Framework for Weakly-Hard Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtas.2019.00028openalex-snapshot
Job-Class-Level Fixed Priority Scheduling of Weakly-Hard Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtas54340.2022.00026openalex-snapshot
WeaklyHard.jl: Scalable Analysis of Weakly-Hard Constraints
inferred← citeshttps://doi.org/10.1109/rtas65571.2025.00031openalex-snapshot
Handling System Overloads: An Empirical Evaluation of Deadline-Miss Handling Strategies
inferred← citeshttps://doi.org/10.1109/rtas68450.2026.00008openalex-snapshot
Weakly-Hard Real-Time Flow Scheduling in Time-Sensitive Networks
inferred← citeshttps://doi.org/10.1109/rtss.2018.00039openalex-snapshot
A Generic Coq Proof of Typical Worst-Case Analysis
inferred← citeshttps://doi.org/10.1109/rtss62706.2024.00030openalex-snapshot
Towards Principled Budget Enforcement in Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtss66672.2025.00054openalex-snapshot
Work-in-Progress: A Practical Linux Framework for Weakly-Hard Tasks with Constant Bandwidth Server
inferred← citeshttps://doi.org/10.1109/tcad.2021.3061522openalex-snapshot
Fixed-Priority Scheduling for Reliable and Energy-Aware ( m , k )-Deadlines Enforcement With Standby-Sparing
inferred← citeshttps://doi.org/10.1109/tcad.2022.3199146openalex-snapshot
Characterizing the Effect of Deadline Misses on Time-Triggered Task Chains
inferred← citeshttps://doi.org/10.1145/3302504.3311811openalex-snapshot
Formal verification of weakly-hard systems
inferred← citeshttps://doi.org/10.1145/3313151.3313165openalex-snapshot
Exploring weakly-hard paradigm for networked systems
inferred← citeshttps://doi.org/10.1145/3356865openalex-snapshot
Weakly-hard Real-time Guarantees for Earliest Deadline First Scheduling of Independent Tasks
inferred← citeshttps://doi.org/10.1145/3400302.3415717openalex-snapshot
Leveraging weakly-hard constraints for improving system fault tolerance with functional and timing guarantees
inferred← citeshttps://doi.org/10.1145/3404888openalex-snapshot
Generalized Weakly Hard Schedulability Analysis for Real-Time Periodic Tasks
inferred← citeshttps://doi.org/10.1145/3477031openalex-snapshot
Cross-Layer Adaptation with Safety-Assured Proactive Task Job Skipping
inferred← citeshttps://doi.org/10.1145/3566097.3567848openalex-snapshot
Safety-Aware Flexible Schedule Synthesis for Cyber-Physical Systems Using Weakly-Hard Constraints
inferred← citeshttps://doi.org/10.1145/3603380openalex-snapshot
System Verification and Runtime Monitoring with Multiple Weakly-Hard Constraints
inferred← citeshttps://doi.org/10.1145/3609123openalex-snapshot
Stochastic Analysis of Control Systems Subject to Communication and Computation Faults
inferred← citeshttps://doi.org/10.1145/3631587openalex-snapshot
Energy-Constrained Scheduling for Weakly Hard Real-Time Systems Using Standby-Sparing
inferred← citeshttps://doi.org/10.1145/3648365openalex-snapshot
Energy Management for Fault-tolerant (m,k)-constrained Real-time Systems That Use Standby-Sparing
inferred← citeshttps://doi.org/10.1145/3672608.3707844openalex-snapshot
Efficient Scheduling of Weakly-Hard Real-Time Tasks with Sufficient Schedulability Condition
inferred← citeshttps://doi.org/10.1145/3748329openalex-snapshot
P 2 SDS : A Polynomial-Time Pattern-Guided Stable Dynamic Scheduling for Weakly Hard Control Task Systems
inferred← citeshttps://doi.org/10.1145/3760528openalex-snapshot
A Formal Approach towards Safe and Stable Schedule Synthesis in Weakly Hard Control Systems
inferred← citeshttps://doi.org/10.1145/3770865.3770868openalex-snapshot
Sufficient Schedulability Condition for Scheduling Weakly-Hard Real-Time Tasks Considering Job-Kill and Skip-Next Strategies
inferred← citeshttps://doi.org/10.1145/3786342openalex-snapshot
Global Scheduling of Weakly-Hard Real-Time Tasks using Job-Level Priority Classes
inferred← citeshttps://doi.org/10.1587/transinf.2022edp7073openalex-snapshot
Evaluation and Comparison of Integer Programming Solvers for Hard Real-Time Scheduling
inferred← citeshttps://doi.org/10.3390/s23104652openalex-snapshot
Weakly Hard Real-Time Model for Control Systems: A Survey
inferred← citeshttps://doi.org/10.4995/riai.2022.17148openalex-snapshot
Planificación de sistemas de tiempo real crítico mediante técnicas no convencionales
inferred← citeshttps://doi.org/10.4995/thesis/10251/203212openalex-snapshot
Investigación de nuevas metodologías para la planificación de sistemas de tiempo real multinúcleo mediante técnicas no convencionales
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.