Temporal decomposition for design and verification
AssigneeCadence Design Systems, Inc.
InventorsAndreas Kuehlmann, Xiaoqun Du
Life of this patent
Estimating the term…
Abstract
Behavior of a finite state machine is represented by unfolding a transition relation that represents combinational logic behavior of the finite state machine into a sequence of transition relations representing combinational logic behavior of the finite state machine in a sequence of time frames. At least one state is determined in a transition relation in the sequence that cannot be reached in a subsequent transition relation in the sequence. A subsequent transition relation in the sequence in which the at least one state cannot be reached is simplified with respect to the at least one unreachable state.
Claims16
A method of simulating behavior of a finite state machine comprising:
- using a computer to simulate behavior of a finite state machine, using as a simulation model, a sequence of one or more transition relations that represent combinational logic behavior of the finite state machine during an initial set of time frames;
- and
- after the initial set of time frames, using as a simulation model, a version of a transition relation that is simplified with respect to at least one state that is unreachable after the initial set of time frames.
A system to simulate behavior of a finite state machine comprising:
- a sequence of one or more transition relations that comprise combinational logic of the finite state machine during an initial set of time frames;
- and
- a version of a transition relation that comprises combinational logic that is simplified with respect to at least one state that is unreachable after the initial set of time frames.
An article of manufacture that includes non-transitory memory media encoded with code to cause a computer to perform a process to simulate behavior of a finite state machine comprising:
- using as a simulation model, a sequence of one or more transition relations that represent combinational logic behavior of the finite state machine during an initial set of time frames;
- and
- after the initial set of time frames, using as a simulation model, a version of the transition relation that is simplified with respect to at least one state that is unreachable after the initial set of time frames.
Dependencies are inferred from the claim text.