P-time event graphs (P-TEGs) are where the residence time of tokens in places is bounded by specified windows. In this paper, we define a new property PTEGs, called weak consistency. weakly consistent P-TEGs, number times transition can fire before first violation constraint be made as large desired. We show practical implications and, based on previous results graph theory, formulate an algori...