On the public citation graph
Quantifying the Effect of Rare Timing Events with Settling-Time and Overshoot
0 signed · 40 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/11603009_1openalex-snapshot
Modular Performance Analysis of Distributed Embedded Systems
inferredcites →https://doi.org/10.1007/3-540-63875-x_44openalex-snapshot
Sensitivity analysis of real-time task sets
inferredcites →https://doi.org/10.1007/978-3-540-45212-6_1openalex-snapshot
A Probabilistic Framework for Schedulability Analysis
inferredcites →https://doi.org/10.1007/bf00360340openalex-snapshot
Scheduling aperiodic tasks in dynamic priority systems
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/b978-155860702-6/50016-8openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1016/s1383-7621(99)00008-9openalex-snapshot
The meaning and role of value in scheduling flexible real-time systems
inferredcites →https://doi.org/10.1023/a:1015398403337openalex-snapshot
Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms*
inferredcites →https://doi.org/10.1023/b:time.0000048932.30002.d9openalex-snapshot
Rate Monotonic vs. EDF: Judgment Day
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.620484openalex-snapshot
Scheduling for overload in real-time systems
inferredcites →https://doi.org/10.1109/iscas.2000.858698openalex-snapshot
Real-time calculus for scheduling hard real-time systems
inferredcites →https://doi.org/10.1109/jproc.2002.802002openalex-snapshot
Theories and models for Internet quality of service
inferredcites →https://doi.org/10.1109/real.1990.128746openalex-snapshot
Preemptively scheduling hard-real-time sporadic tasks on one processor
inferredcites →https://doi.org/10.1109/real.1992.242671openalex-snapshot
An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems
inferredcites →https://doi.org/10.1109/real.1995.495199openalex-snapshot
Value vs. deadline scheduling in overload conditions
inferredcites →https://doi.org/10.1109/real.1995.495201openalex-snapshot
Skip-Over: algorithms and complexity for overloaded systems that allow skips
inferredcites →https://doi.org/10.1109/real.1997.641268openalex-snapshot
Combining (/sub m//sup n/)-hard deadlines and dual priority scheduling
inferredcites →https://doi.org/10.1109/rttas.1995.516213openalex-snapshot
Probabilistic performance guarantee for real-time tasks with varying computation times
inferredcites →https://doi.org/10.1109/tc.2004.10openalex-snapshot
Dynamic window-constrained scheduling of real-time streams in media servers
inferredcites →https://doi.org/10.1145/1151659.1159929openalex-snapshot
A basic stochastic network calculus
inferredcites →https://doi.org/10.1145/1159913.1159929openalex-snapshot
A basic stochastic network calculus
inferredcites →https://doi.org/10.1145/2228360.2228484openalex-snapshot
A hybrid approach to cyber-physical systems verification
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.3929/ethz-a-005328667openalex-snapshot
Modular performance analysis and interface-based design for embedded 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.1109/dac.2014.6881371openalex-snapshot
Typical worst case response-time analysis and its use in automotive network design
inferred← citeshttps://doi.org/10.1109/ecrts.2015.29openalex-snapshot
Improved Deadline Miss Models for Real-Time Systems Using Typical Worst-Case Analysis
inferred← citeshttps://doi.org/10.1109/rtas68450.2026.00014openalex-snapshot
Shape-Aware Analysis of End-to-End Latency Under LET
inferred← citeshttps://doi.org/10.1109/rtss.2016.037openalex-snapshot
Systems with Dynamic Real-Time Guarantees in Uncertain and Faulty Execution Environments
inferred← citeshttps://doi.org/10.1109/rtss62706.2024.00028openalex-snapshot
In Search of Butterflies: Exceedance Analysis for Real-Time Systems under Transient Overload
inferred← citeshttps://doi.org/10.1109/sies.2016.7509419openalex-snapshot
System-level timing feasibility test for cyber-physical automotive systems
inferred← citeshttps://doi.org/10.1145/2593069.2602977openalex-snapshot
Typical Worst Case Response-Time Analysis and its Use in Automotive Network Design
inferred← citeshttps://doi.org/10.1145/2656045.2656059openalex-snapshot
Extending typical worst-case analysis using response-time dependencies to bound deadline misses
inferred← citeshttps://doi.org/10.1145/3126497openalex-snapshot
Weakly Hard Schedulability Analysis for Fixed Priority Scheduling of Periodic Real-Time Tasks
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/3404888openalex-snapshot
Generalized Weakly Hard Schedulability Analysis for Real-Time Periodic Tasks
inferred← citeshttps://doi.org/10.23919/date.2017.7927054openalex-snapshot
Bounding deadline misses in weakly-hard real-time systems with task dependencies
inferred← citeshttps://doi.org/10.48550/arxiv.1305.1459openalex-snapshot
EURETILE 2010-2012 summary: first three years of activity of the European Reference Tiled Experiment
inferred← citeshttps://doi.org/10.5555/2616606.2616836openalex-snapshot
Computing a language-based guarantee for timing properties of cyber-physical systems
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.