Feasibility analysis of real-time transactions
Real-Time Systems
Finite automata with time-delay blocks
Proceedings of the tenth ACM international conference on Embedded software
Reducing the gap between design and scheduling
Proceedings of the 20th International Conference on Real-Time and Network Systems
Sufficient real-time analysis for an engine control unit with constant angular velocities
Proceedings of the Conference on Design, Automation and Test in Europe
Task implementation of synchronous finite state machines
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Sufficient real-time analysis for an engine control unit
Proceedings of the 21st International conference on Real-Time Networks and Systems
The fork-join real-time task model
ACM SIGBED Review - Special Issue on the Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12)
On the schedulability of real-time discrete-event systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
Design synthesis and optimization for automotive embedded systems
Proceedings of the 2014 on International symposium on physical design
| Hi-index | 0.00 |
Models for real-time systems have to balance the inherently contradicting goals of expressiveness and analysis efficiency. Current task models with tractable feasibility tests have limited expressiveness, restricting their ability to model many systems accurately. In particular, they are all recurrent, preventing the modeling of structures like mode switches, local loops, etc. In this paper, we advance the state-of-the-art with a model that is free from these constraints. Our proposed task model is based on arbitrary directed graphs (digraphs) for job releases. We show that the feasibility problem on preemptive uniprocessors for our model remains tractable. This even holds in the case of task systems with arbitrary deadlines.