An example finite state machine may include a content-addressable memory. The content-addressable memory may include blocks that respectively store input-terms of the finite state machine. The finite state machine may be configured to, for each received input: select a subset of the blocks of the content addressable memory to enable for searching, the subset being selected based on a current state of the finite state machine, and determine a next state of the finite state machine by searching the currently enabled subset of blocks of the content addressable memory based on the input.

A sequence generating apparatus that generates a sequence representing a state transition of an object, includes input unit configured to input an initial state of the object in a sequence to be generated; setting unit configured to set an end state of the object in the sequence to be generated; generating unit configured to generate a plurality of sequences using a predetermined prediction model on the basis of the initial state; and output unit configured to output at least one of the plurality of sequences, the at least one sequence matching the end state.

A system and method for controlling operating modes of a system, each operating mode being implemented by an execution of one or more software components. This control system includes software components called elementary components, each elementary component having at least one input able to receive input data and/or at least one output able to transmit output data; and at least one software meta-component including one or more internal wiring diagrams, each internal wiring diagram defining interconnections between inputs and outputs of elementary components and/or meta-components, a transition logic between states defining a current state of said system and a sequence between states at least some of the states corresponding to an implementation of an internal wiring diagram, a mechanism for controlling the internal configurations, and a programming interface providing services/functions implementing at least one internal wiring scheme.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing transformation mode switching in a robotics control system. One of the methods includes receiving data representing a state machine that defines one or more portions of a robotics task; executing a first control loop corresponding to a first node of the state machine, wherein executing the first control loop comprises providing commands to the robotic components computed from a first coordinate transformation process; determining, based on one or more status messages, that an exit condition for the first node has been satisfied; performing a mode switch between the first coordinate transformation process and a different second coordinate transformation process; and executing a second control loop corresponding to a second node of the state machine, wherein executing the second control loop comprises providing commands to the robotic components computed from the second coordinate transformation process.

In one embodiment, a device classification service receives a first set of telemetry data captured by one or more networking devices in a network regarding traffic associated with an endpoint device in the network. The service classifies the endpoint device as being of an unknown device type, by applying a machine learning-based classifier to the first set of telemetry data. The service instructs the one or more networking devices in the network to reset a finite state machine (FSM) of the traffic associated with the endpoint device. The device classification service receives a second set of telemetry data regarding traffic associated with the endpoint device and captured after reset of the FSM. The service reclassifies the endpoint device as being of a particular device type, by applying the machine learning-based classifier to the second set of telemetry data.

A method for determining possible transitions of system states in an industrial system with a plurality of agents with discrete agent states. The method includes the step of defining a plurality of rules, each rule having a pre-condition of at least one agent state that is to be changed, a post-condition of the at least one agent state, and an action or actions resulting in a corresponding transition of the at least one agent state. The method further includes the step of defining a plurality of nodes, each node having a system state. The method further includes the step of and evaluating for a plurality of pairs of nodes, whereby one node of each pair acts as a pre-condition node and the other node of each pair acts as a post-condition node, whether the pair can, given the rules, be directly connected by means of an edge. Each edge includes an action or actions required for a transition between the respective pre- and post-condition system states. By determining possible direct transitions between the system states offline, fast runtime decisions by system's controller are allowed to take place.

An example finite state machine may include a content-addressable memory. The content-addressable memory may include blocks that respectively store input-terms of the finite state machine. The finite state machine may be configured to, for each received input: select a subset of the blocks of the content addressable memory to enable for searching, the subset being selected based on a current state of the finite state machine, and determine a next state of the finite state machine by searching the currently enabled subset of blocks of the content addressable memory based on the input.

An overall machine operational state (such as a problem state, field state, machine state, other non-problem state, etc.) is identified, and exit and entry conditions are monitored to determine whether the machine transitions into another operational state. When the machine transitions into a problem state, a multiple input, multiple output control system uses a state machine to identify the problem state and a solution is identified. The solution is indicative of machine settings that will return the machine to an acceptable, operational state. Control signals are generated to modify the machine settings based on the identified solution.

An apparatus for controlling a robot includes a programmable logic controller (PLC) configured to define, based on a finite state machine (FSM): states and associated operations of the robot, and switching conditions among the states, wherein the robot is switched among different states in response to a switching condition being satisfied. The FSM at least includes an initial state for a self-test procedure to check whether components of the robot are able to operate properly, and a calibration state for calibrating the robot. And a method for controlling a robot. The use of PLC programming language facilitates an easy programming and maintenance of the whole robot system.

Exemplary embodiments pertain to a system that can include a high-level controller coupled to a low-level controller for controlling a physical asset. In one exemplary implementation, the high-level controller executes a first finite state machine for controlling a power generation unit via a network. The low-level controller executes a second finite state machine that may have fewer states than the first finite state machine. The second finite state machine places the low-level controller in a default mode of operation for controlling the power generation unit under various conditions such as when the high-level controller is controlling the physical asset during a normal mode of operation; when the high-level controller is revising the first finite state machine; when the high-level controller is controlling the physical asset using a revised first finite state machine; and/or upon detecting a loss of communications between the high-level controller and the low-level controller.