K
Kaj Hänninen
Researcher at Mälardalen University College
Publications - 36
Citations - 407
Kaj Hänninen is an academic researcher from Mälardalen University College. The author has contributed to research in topics: Stack-based memory allocation & Hazard (logic). The author has an hindex of 9, co-authored 32 publications receiving 375 citations.
Papers
More filters
Proceedings ArticleDOI
The Rubus component model for resource constrained real-time systems
Kaj Hänninen,Jukka Mäki-Turja,Mikael Nolin,Mats Lindberg,John Lundbäck,Kurt-Lennart Lundbäck +5 more
TL;DR: A component model for development of distributed real-time systems to support development of embedded control systems for ground vehicles, developed in close cooperation with industrial partners and it is currently being evaluated on real systems.
Proceedings Article
Efficient Development of Real-Time Systems Using Hybrid Scheduling.
TL;DR: This paper will show how advanced embedded realtime systems, with functionality ranging from time-triggered control functionality to event-trIGgered user interaction, can be made more efficient by using a hybrid, static and dynamic, scheduling strategy.
Proceedings ArticleDOI
Determining Maximum Stack Usage in Preemptive Shared Stack Systems
TL;DR: A novel method to determine the maximum stack memory used in preemptive, shared stack, real-time systems and how to safely approximate the exact stack usage by using static information about the system model and the underlying run-time system is presented.
Proceedings ArticleDOI
Present and future requirements in developing industrial embedded real-time systems - interviews with designers in the vehicle domain
TL;DR: This study shows that reliability and safety are the main properties in focus during development of embedded real-time systems, and shows that the amount of functionality has been increasing in the examined systems.
Proceedings ArticleDOI
Bounding Shared-Stack Usage in Systems with Offsets and Precedences
TL;DR: Two novel methods to bound the stack memory used in preemptive, shared stack, real-time systems are presented, based on branch-and-bound search for possible preemption patterns, and one approximates the first in polynomial time.