A widely used method for checking real-time systems is,according to the real-time property to be checked,to use a proper bi-simulation equivalence relation to convert the infinite-timed state space to a finite equivalence class space.The algorithm needs only to explore the finite space to get a correct answer.In most cases,exhaustive exploration is very difficult because the equivalence class space increases explosively when the scale of the system increases.In this paper,an equivalence relation is introduced to check whether a concurrent system,which is composed of a finite set of real-time automata,satisfies a linear duration property.To avoid exhaustive exploration,this paper also introduces a compatibility relation between timed states (configurations).Based on these two relations,an algorithm is proposed to check whether a real-time automaton network satisfies a linear duration property.The cases study shows that under some conditions this algorithm has better efficiency than the tools in the literature.