On the public citation graph

Robustness Analysis for Scheduling Problems Using the Inverse Method

0 signed · 39 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.1007/11603009_7openalex-snapshot
Beyond Liveness: Efficient Parameter Synthesis for Time Bounded Liveness
inferredcites →https://doi.org/10.1007/3-540-46002-0_9openalex-snapshot
Preemptive Job-Shop Scheduling Using Stopwatch Automata
inferredcites →https://doi.org/10.1007/978-3-642-00768-2_6openalex-snapshot
Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches
inferredcites →https://doi.org/10.1109/32.637144openalex-snapshot
Bounding completion times of jobs with arbitrary release times, variable execution times and resource sharing
inferredcites →https://doi.org/10.1109/etfa.2010.5641315openalex-snapshot
Parametric analysis of distributed firm real-time systems: A case study
inferredcites →https://doi.org/10.1109/rtss.2008.36openalex-snapshot
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata
inferredcites →https://doi.org/10.1109/sies.2011.5953652openalex-snapshot
Robustness in real-time systems
inferredcites →https://doi.org/10.1109/tc.2004.103openalex-snapshot
Schedulability analysis of periodic fixed priority systems
inferredcites →https://doi.org/10.1142/s0129054109006905openalex-snapshot
AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA

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-32505-3_7openalex-snapshot
Time4sys2imi: A Tool to Formalize Real-Time System Models Under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_26openalex-snapshot
IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_27openalex-snapshot
Merge and Conquer: State Merging in Parametric Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-05416-2_14openalex-snapshot
Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-29510-7_3openalex-snapshot
What’s Decidable About Parametric Timed Automata?
inferred← citeshttps://doi.org/10.1007/978-3-642-24288-5_17openalex-snapshot
Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method
inferred← citeshttps://doi.org/10.1007/978-3-662-60651-3_3openalex-snapshot
Parametric Verification: An Introduction
inferred← citeshttps://doi.org/10.1007/978-3-662-73305-9_6openalex-snapshot
Model Checking Timed and Strategic Properties
inferred← citeshttps://doi.org/10.1007/978-981-96-0617-7_3openalex-snapshot
Tuning Trains Speed in Railway Scheduling
inferred← citeshttps://doi.org/10.1007/s10009-017-0467-0openalex-snapshot
What’s decidable about parametric timed automata?
inferred← citeshttps://doi.org/10.1007/s10270-020-00787-5openalex-snapshot
Automated synthesis of local time requirement for service composition
inferred← citeshttps://doi.org/10.1007/s11241-014-9208-6openalex-snapshot
Parameter synthesis for hierarchical concurrent real-time systems
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102654openalex-snapshot
Abstraction models for verifying resource adequacy of IMA systems at concept level
inferred← citeshttps://doi.org/10.1051/matecconf/20179510001openalex-snapshot
Genetic Algorithm Combined with Gradient Information for Flexible Job-shop Scheduling Problem with Different Varieties and Small Batches
inferred← citeshttps://doi.org/10.1109/acsd.2019.00006openalex-snapshot
Parametric Schedulability Analysis of a Launcher Flight Control System Under Reactivity Constraints
inferred← citeshttps://doi.org/10.1109/iceccs.2012.29openalex-snapshot
Parameter synthesis for hierarchical concurrent real-time systems
inferred← citeshttps://doi.org/10.1109/iceccs.2013.26openalex-snapshot
Observer Patterns for Real-Time Systems
inferred← citeshttps://doi.org/10.1109/icse.2013.6606600openalex-snapshot
Dynamic synthesis of local time requirement for service composition
inferred← citeshttps://doi.org/10.1109/rtcsa.2014.6910502openalex-snapshot
Component-based analysis of hierarchical scheduling using linear hybrid automata
inferred← citeshttps://doi.org/10.1109/tase.2019.000-3openalex-snapshot
Formalizing Time4sys using parametric timed automata
inferred← citeshttps://doi.org/10.1145/2463596.2463600openalex-snapshot
Design of safety-critical Java level 1 applications using affine abstract clocks
inferred← citeshttps://doi.org/10.1145/2465554.2465558openalex-snapshot
Buffer minimization in earliest-deadline first scheduling of dataflow graphs
inferred← citeshttps://doi.org/10.1145/2491899.2465558openalex-snapshot
Buffer minimization in earliest-deadline first scheduling of dataflow graphs
inferred← citeshttps://doi.org/10.1145/2499369.2465558openalex-snapshot
Buffer minimization in earliest-deadline first scheduling of dataflow graphs
inferred← citeshttps://doi.org/10.1145/3563822.3569923openalex-snapshot
Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata
inferred← citeshttps://doi.org/10.3233/fi-2021-2065openalex-snapshot
Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints*
inferred← citeshttps://doi.org/10.3384/9789180756143openalex-snapshot
Exploring Trade-offs in Concept Design of Integrated Modular Avionic Platform Configurations : Topology Generation, Resource Adequacy, and Dependability
inferred← citeshttps://doi.org/10.70675/567c7296z07f4z4fbfz83d4z7d92e3f3e650openalex-snapshot
Efficient Parametric Verification of Parametric Timed Automata
inferred← citeshttps://doi.org/10.70675/9909c56dz2678z4612zba67z9d3f86555c83openalex-snapshot
Synthesis of correct-by-design schedulers for hybrid systems
inferred← citeshttps://doi.org/10.70675/bf8d6638z66d4z454azadbaz31d14c6d7723openalex-snapshot
Guaranteed properties of dynamical systems under perturbations
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.