Wardana [14] defines timed automation as a 4 typle A = (L; l0;E; I) where: L is a finite set of locations, l0 2 L is an initial location, E is a finite set of edges, I : L ! C is a set of mappings of invariants to location, including timing information as clock constraints and synchronization actions for interaction purposes among several timed automata, a so called time automata network.