US 12,572,475 B2 · Compact representation of transition sequences for single-state storage

Abstract

A system-implemented (e.g., computer-implemented) method for generating a set of hashes representing known-good state sequences, in accordance with one aspect of the present invention, includes determining, a priori, all known-good state sequences of a system. Valid paths for the determined known-good state sequences are enumerated by constructing history-incorporating aggregate hashes that represent the states along the paths, whereby the resulting set of hashes represents all valid states as the system traverse through the known-good sequences. The history-incorporating aggregate hashes are stored. A state-advancing call is received from the system, and in response to receiving the call, the stored history-incorporating aggregate hashes are sent to the system.

Claims18

Dependent claims

A computer-implemented method, comprising:

in response to receiving a request to transition a system to a new state, requesting a set of history-incorporating aggregate hashes;
receiving the history-incorporating aggregate hashes;
evaluating whether to transition to the new state by:
calculating a hash for the requested new state,
comparing the calculated hash to the received history-incorporating aggregate hashes, and
allowing the transition to the new state in response to determining that the calculated hash matches one of the history-incorporating aggregate hashes, else not allowing the transition to the new state in response to determining that the calculated hash does not match one of the history-incorporating aggregate hashes;
and
storing a hash of a final state reached in response to execution in a state machine being terminated in the system.

5 more elements

Dependencies are inferred from the claim text.

Compact representation of transition sequences for single-state storage

Life of this patent

Compact representation of transition sequences for single-state storage

Life of this patent

Abstract

Claims18