1. A method for computer-assisted exploration of states of a technical system, comprising: running consecutive states of the technical system by an action whereby executing the action in a respective state leads to a new state being executed; using a safety function to determine whether the action is a permissible or impermissible action in the technical system before an execution of the action leads to an unknown state not previously run, with the action only being executed if the action is permissible; and selecting a subsequent action based on a backup policy when reaching the unknown state in order to return the state to a known state whereby a known state is a previously run state, wherein the action executed is assigned a reward as a function of the state in which the action is executed, and wherein the new state is reached by the action, wherein the impermissible action features the reward which is smaller than a prespecified value, wherein the safety function is learned based on a plurality of rewards of a plurality of actions, and wherein a pair comprising the state and the action executed in the state run are assigned a minimum reward which after the execution of the action and on subsequently running the backup policy occurs for the action, wherein the safety function is determined based on the minimum reward, and wherein the safety function establishes the impermissible action if the minimum reward is smaller than the prespecified value.