VERIFICATION BASED ON DISJUNCTIVE TRANSITION RELATION DECOMPOSITION

摘要

PPROBLEM TO BE SOLVED: To provide a technique enabling flexible and efficient hardware and software verification. PSOLUTION: In the method and system for building disjunctive transition relation decompositions of a system and obtaining reachable states from manipulation of the transition relation, properties of the system may be verified by analyzing reachable states obtained with respect to a target specification of the system. PCOPYRIGHT: (C)2008,JPO&INPIT