A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
From MaRDI portal
(Redirected from Publication:779456)
Recommendations
- An automaton model for scheduling constraints in synchronous machines
- Applying real-time scheduling theory to the synchronous data flow model of computation
- Analysis of scheduling behaviour using generic timed automata
- Uniprocessor scheduling of real-time synchronous dataflow tasks
- Schedulability analysis of fixed-priority systems using timed automata
Cites work
- scientific article; zbMATH DE number 627763 (Why is no real title available?)
- Combinatorial abstraction refinement for feasibility analysis of static priorities
- Computing periodic request functions to speed-up the analysis of non-cyclic task models
- Dynamic- and static-priority scheduling of recurring real-time tasks
- Faster parametric shortest path and minimum‐balance algorithms
- Generalized matrix period in max-plus algebra
- Graph-based models for real-time workload: a survey
- Linear matrix period in max-plus algebra
- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
- Statecharts: a visual formalism for complex systems
- Task automata: Schedulability, decidability and undecidability
- Transience bounds for long walks
This page was built for publication: A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779456)
