Real-Time Systems
On the Construction of Live Timed Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Modeling Urgency in Timed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Giotto: A Time-Triggered Language for Embedded Programming
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Task automata: Schedulability, decidability and undecidability
Information and Computation
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
The Digraph Real-Time Task Model
RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
On the schedulability of real-time discrete-event systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
On the schedulability of real-time discrete-event systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
We consider end-to-end latency specifications for hard real-time embedded systems. We introduce a discrete-event programming model generalizing such specifications, and address its schedulability problem for uniprocessor systems. This turns out to be rather idiosyncratic, involving complex, time-dependent release predicates and precedence constraints, quite unlike anything we have seen in the hard real-time computing literature. We prove the optimality of the earliest-deadline-first scheduling policy, and provide an algorithmic solution, reducing the schedulability problem to a reachability problem for timed automata.