Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Temporal Induction<br />
Assuming we have proven our asserts to hold for the first three non-init time steps:<br />
Then this will prove our asserts for all reachable time steps:<br />
If this proof succeeds we are done. We have proven our properties to hold in all<br />
reachable states.<br />
However, if this proof fails it does not automatically imply that there is a problem <strong>with</strong><br />
the design. For example, the induction length could be too short, or the design might<br />
not be provable by temporal induction at all.