Minimization of Timed Transition Systems

15 For a formula = 93 c , the algorithm is the same; the initial partition now distinguishes between the cases ~ x0] = 0 and 0 < ~ x0] c and 0 < ~ x0] 6 6 c. The analysis for = 83 c is similar; the initial partition now needs to account for the progressiveness assumption also (as in the case of 83). Automatic veriication of nite-state concurrent systems using temporal-logic speciications. 14 certain sets of regions. In particular, these constraints require that for every clock i, the constraint ~ xi] = 0 or ~ xi] > c i holds at innnitely many regions along the path (here, c i is the largest constant in a constraint involving x in the enabling conditions of G). We can use this fact to handle progressiveness in our reduced region graphs.