On the public citation graph

Approximate Response Time Analysis of Real-Time Task Graphs

0 signed · 37 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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.1023/a:1008030427220openalex-snapshot
Generalized Multiframe Tasks
inferredcites →https://doi.org/10.1023/a:1021711220939openalex-snapshot
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
inferredcites →https://doi.org/10.1109/32.637146openalex-snapshot
A multiframe model for real-time tasks
inferredcites →https://doi.org/10.1109/ecrts.2005.15openalex-snapshot
Fast and Tight Response-Times for Tasks with Offsets
inferredcites →https://doi.org/10.1109/ecrts.2011.23openalex-snapshot
On the Tractability of Digraph-Based Task Models
inferredcites →https://doi.org/10.1109/ecrts.2012.13openalex-snapshot
Hardness Results for Static Priority Real-Time Scheduling
inferredcites →https://doi.org/10.1109/ecrts.2014.29openalex-snapshot
Refinement-Based Exact Response-Time Analysis
inferredcites →https://doi.org/10.1109/emwrts.1998.685078openalex-snapshot
Feasibility analysis of recurring branching tasks
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.1996.563696openalex-snapshot
A multiframe model for real-time tasks
inferredcites →https://doi.org/10.1109/real.1998.739728openalex-snapshot
Schedulability analysis for tasks with static and dynamic offsets
inferredcites →https://doi.org/10.1109/rtas.2011.15openalex-snapshot
The Digraph Real-Time Task Model
inferredcites →https://doi.org/10.1109/rtas.2014.6925990openalex-snapshot
Schedulability tests for tasks with Variable Rate-dependent Behaviour under fixed priority scheduling
inferredcites →https://doi.org/10.1109/rtcsa.1997.629177openalex-snapshot
Schedulability of generalized multiframe task sets under static priority assignment
inferredcites →https://doi.org/10.1109/rtss.2010.19openalex-snapshot
The Non-cyclic Recurring Real-Time Task Model
inferredcites →https://doi.org/10.1109/rtss.2013.41openalex-snapshot
Combinatorial Abstraction Refinement for Feasibility Analysis
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1145/347476.347479openalex-snapshot
Speed is as powerful as clairvoyance

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.2990openalex-snapshot
Probabilistic response‐time analysis for real‐time systems in body area sensor networks
inferred← citeshttps://doi.org/10.1007/s11241-017-9290-7openalex-snapshot
Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
inferred← citeshttps://doi.org/10.1007/s11241-018-9307-xopenalex-snapshot
A hybrid performance analysis technique for distributed real-time embedded systems
inferred← citeshttps://doi.org/10.1007/s11241-019-09331-1openalex-snapshot
A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
inferred← citeshttps://doi.org/10.1109/access.2019.2906011openalex-snapshot
Modeling and Timing Analysis for Microkernel-Based Real-Time Embedded System
inferred← citeshttps://doi.org/10.1109/ecrts.2016.17openalex-snapshot
Schedulability Analysis of Synchronous Digraph Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/euc57774.2022.00027openalex-snapshot
The Generalized Graph Real-Time Task Model
inferred← citeshttps://doi.org/10.1109/fruct-ispit.2016.7561502openalex-snapshot
The impact of blocking factor on real-time applications feasibility
inferred← citeshttps://doi.org/10.1109/rtcsa.2015.36openalex-snapshot
Techniques for Schedulability Analysis in Mode Change Systems under Fixed-Priority Scheduling
inferred← citeshttps://doi.org/10.1109/rtcsa.2016.13openalex-snapshot
Transforming Real-Time Task Graphs to Improve Schedulability
inferred← citeshttps://doi.org/10.1109/rtss.2016.041openalex-snapshot
k2Q: A Quadratic-Form Response Time and Schedulability Analysis Framework for Utilization-Based Analysis
inferred← citeshttps://doi.org/10.1109/rtss.2018.00054openalex-snapshot
Schedulability Analysis of Adaptive Variable-Rate Tasks with Dynamic Switching Speeds
inferred← citeshttps://doi.org/10.1109/tcad.2020.3012174openalex-snapshot
Efficient Feasibility Analysis for Graph-Based Real-Time Task Systems
inferred← citeshttps://doi.org/10.1109/tvt.2017.2737035openalex-snapshot
WCRT Analysis of CAN Messages in Gateway-Integrated In-Vehicle Networks
inferred← citeshttps://doi.org/10.1145/3273905.3273918openalex-snapshot
A Generalized Digraph Model for Expressing Dependencies
inferred← citeshttps://doi.org/10.1145/3284178openalex-snapshot
Exact WCRT Analysis for Message-Processing Tasks on Gateway-Integrated In-Vehicle CAN Clusters
inferred← citeshttps://doi.org/10.23940/ijpe.19.03.p16.872883openalex-snapshot
Time-Oriented Modeling and Analysis for Real-Time System under Variability
inferred← citeshttps://doi.org/10.70675/43adeeecz02d3z4c27zab4ez0373161078a9openalex-snapshot
Certified Tools for Schedulability Analyses
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.