10. The method in claim 1 wherein the property checking schema for the said LTL operator G(p) 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 of the circuit, b) adding a constraint to the database to ensure that p is satisfied in the i th state of a path, and checking for satisfiability, c) if unsatisfiable, terminating the search with failure, d) if satisfiable, checking for each j th state from the start state to i th state whether it is a loopback state and terminating the search with success if a loopback state is found; e) checking for each j th state before the start state whether it is a loopback state and terminating the search with success if a loopback state is found; f) continuing the search by increasing i until the said time frame bound is reached and repeating steps a-e; g) terminating the search inconclusively if the said time frame bound is reached.
10. The method in claim 1 wherein the property checking schema for the said LTL operator G(p) 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 of the circuit, b) adding a constraint to the database to ensure that p is satisfied in the i th state of a path, and checking for satisfiability, c) if unsatisfiable, terminating the search with failure, d) if satisfiable, checking for each j th state from the start state to i th state whether it is a loopback state and terminating the search with success if a loopback state is found; e) checking for each j th state before the start state whether it is a loopback state and terminating the search with success if a loopback state is found; f) continuing the search by increasing i until the said time frame bound is reached and repeating steps a-e; g) terminating the search inconclusively if the said time frame bound is reached. 13. The method of claim 10 further comprising checking for completeness of a solution between steps e and f, to determine failure wherein, failure characterizes that success in step e is not achievable for any time frame i.