Schedulability analysis of periodic and aperiodic tasks with resource constraints
Journal of Systems Architecture: the EUROMICRO Journal - Special issue on real-time systems
Scheduler Modeling Based on the Controller Synthesis Paradigm
Real-Time Systems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Resource Sharing in EDF-Scheduled Systems: A Closer Look
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
The Design of an EDF-Scheduled Resource-Sharing Open Environment
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Brief paper: Supervisory control of modular systems with global specification languages
Automatica (Journal of IFAC)
Information Sciences: an International Journal
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Multiprocessor scheduling in supervisory control of discrete-event systems framework
Control and Intelligent Systems
Hi-index | 22.14 |
In the framework of supervisory control of timed discrete event systems, this paper addresses the design problem of a real-time scheduler that meets stringent time constraints of periodic tasks and sporadic tasks which exclusively access shared resources. For this purpose, we present the timed discrete event models of execution of periodic tasks and sporadic tasks and resource access for shared resources. Based on these models, we present the notion of deadlock-free and schedulable languages that contain only deadline-meeting sequences which do not reach deadlock states. In addition, we present the method of systematically computing the largest deadlock-free and schedulable language, and it is also shown that schedulability analysis can be done using this language. We further show that the real-time scheduler achieving the largest deadlock-free and schedulable language is optimal in the sense that there are no other schedulers to achieve schedulable cases more than those achieved by the optimal scheduler.