The aim of this paper is to prove that the question “is a scheduling functionally deterministic for a given set of periodic real time tasks and a given conservative scheduling policy” is decidable. For thar purpose, we encode the tasks and the scheduler by an acyclic stopwatch automaton. We show then that the previous question can be encoded by a decidable reachability problem.