A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs

DOI10.1007/s11241-019-09331-1zbMath1436.68071OpenAlexW2920205658WikidataQ128292845 ScholiaQ128292845MaRDI QIDQ779456

Haibo Zeng, Marco Di Natale, Chao Peng

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

zbMATH Keywords

embedded systemsschedulability analysisrequest/interference bound functionssynchronous reactive models

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• SCADE
• Simulink
• Algorithm 97

Cites Work

• Unnamed Item
• Computing periodic request functions to speed-up the analysis of non-cyclic task models
• Graph-based models for real-time workload: a survey
• Combinatorial abstraction refinement for feasibility analysis of static priorities
• Statecharts: a visual formalism for complex systems
• Dynamic- and static-priority scheduling of recurring real-time tasks
• Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
• Linear matrix period in max-plus algebra
• Generalized matrix period in max-plus algebra
• Task automata: Schedulability, decidability and undecidability
• Transience Bounds for Long Walks
• Faster parametric shortest path and minimum‐balance algorithms

This page was built for publication: A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs