A Conservative Approximation Method for the Verification of Preemptive Scheduling Using Timed Automata

Gabor Madl, Nikil Dutt, Sherif Abdelwahed
2009 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium  
This paper presents a conservative approximation method for the real-time verification of asynchronous event-driven distributed systems. This problem is known to be undecidable in the generic setting. The proposed approach is based on composable timed automata models that provide a sufficient condition to determine schedulability. We demonstrate the method on a real-time CORBA avionics design.
doi:10.1109/rtas.2009.32 dblp:conf/rtas/MadlDA09 fatcat:xba2tt4lobhzrpl35xsekiz7dq