Simulation of Preemptive Scheduling of the Independent Tasks Using Timed Automata

To consider the effects of preemptive scheduling occurred in the concurrent threads of the independent tasks with priority values, we propose an alternative to simulate the preemptive scheduling using timed automata tool. Firstly, each independent task with priority value is expected to be represented as an ordinary timing diagram with its priority value. The timing diagram focuses on the state changings within and among lifeline along a linear timeline, of a particular independent task. Then, we propose a set of translating rules to map the timing diagrams and their associated priority values into the corresponding timed automata with the extra dormant states as to serve the task preemptions. Our resulting timed automata are sufficient and ready to be simulated using UPPAAL real-time simulation tool, yielding the model-in-loop simulation as to verify the logic hazards that might be found in the preemptive scheduling. The possibility of the violation of the hard time constraint and deadlock is checked.