16. The method in claim 1 wherein the property checking schema for the said LTL operator U(p, q) for a given time frame bound comprises: a) starting search from a given start state at time frame i with a given constraint database, wherein i=0 corresponds to an initial state; b) checking for satisfiability of q in the i th state of a path, c) if satisfiable, terminating the search with success; d) if unsatisfiable, learning that q is always false in the i th state and adding this knowledge to the constraint database; e) adding the constraint to the database to ensure that p is satisfied in the i th state, and checking for satisfiability; f) if unsatisfiable in step e, terminating the search with failure; g) if satisfiable in step e, continuing the search; h) continuing the search by increasing i until the said time frame bound is reached and repeating steps b-g; and i) terminating the search inconclusively if the said time frame bound is reached.
16. The method in claim 1 wherein the property checking schema for the said LTL operator U(p, q) for a given time frame bound comprises: a) starting search from a given start state at time frame i with a given constraint database, wherein i=0 corresponds to an initial state; b) checking for satisfiability of q in the i th state of a path, c) if satisfiable, terminating the search with success; d) if unsatisfiable, learning that q is always false in the i th state and adding this knowledge to the constraint database; e) adding the constraint to the database to ensure that p is satisfied in the i th state, and checking for satisfiability; f) if unsatisfiable in step e, terminating the search with failure; g) if satisfiable in step e, continuing the search; h) continuing the search by increasing i until the said time frame bound is reached and repeating steps b-g; and i) terminating the search inconclusively if the said time frame bound is reached. 19. The method of claim 16 , wherein a subset of satisfiability checks is combined into a single satisfiability check.