In this paper we present the model of a system of periodic real-time tasks with fixed priorities, preemption and synchronization, performed by a robot controler, using Marked Graphs. Then, with the help of the (max,plus) algebra, we derive simple tests to check real time constraints on those tasks such as response times and the respect of deadlines. This method takes into account precedence and synchronization constraints and is not limited to a particular scheduling policy.