A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
DOI10.1007/S11241-019-09331-1zbMATH Open1436.68071OpenAlexW2920205658WikidataQ128292845 ScholiaQ128292845MaRDI QIDQ779456FDOQ779456
Authors: Chao Peng, Haibo Zeng, Marco Di Natale 
Publication date: 13 July 2020
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-019-09331-1
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
schedulability analysisembedded systemsrequest/interference bound functionssynchronous reactive models
Cites Work
- Title not available (Why is that?)
- Statecharts: a visual formalism for complex systems
- Combinatorial abstraction refinement for feasibility analysis of static priorities
- Generalized matrix period in max-plus algebra
- Transience bounds for long walks
- Task automata: Schedulability, decidability and undecidability
- Linear matrix period in max-plus algebra
- Dynamic- and static-priority scheduling of recurring real-time tasks
- Faster parametric shortest path and minimum‐balance algorithms
- Computing periodic request functions to speed-up the analysis of non-cyclic task models
- Graph-based models for real-time workload: a survey
- Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
Cited In (1)
Uses Software
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)
