# US 2018/0321952 A1 · System and method for device programming using finite state machines

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0321952 A1
- Document ID: US20180321952A1
- Status: Published application
- Kind: A1
- Application number: 15/972,030
- Filed: 2018-05-04
- Published: 2018-11-08
- Earliest claimed: 2017-05-04
- Assignees: Kirio Inc.
- Applicants: Kirio Inc.
- Inventors: Franck Rougier; Yesid Julian Ramos Martinez
- Web page: https://patentgrep.com/patent/US20180321952A1

## CPC

- G06F 9/4498: {Finite state machines}
- G05B 15/02: electric
- G05B 19/0426: {Programming the control sequence}
- G06F 17/16: Matrix or vector computation {, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization (matrix transposition G06F7/78)}
- G06N 7/00: Computing arrangements based on specific mathematical models
- G05B 2219/23289: State logic control, finite state, tasks, machine, fsm
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G05B: CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS (systems for controlling or regulating non-electric variables G05D; systems for regulating electric or magnetic variables G05F; control devices or systems insofar as characterised by mechanical features only G05G)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A virtual machine allows for the control of an automation network by utilizing finite state machines to model the device network and map commands to real-world devices. The finite state machines may be constructed utilizing information on transitions and state descriptions specified in a file, as well as logic descriptions.

## Claims

### Claim 1

A method comprising:
a finite state machine interpreter receiving a transition and state description and a logic description from a user interface;
applying the transition and state description to a parser to parse the transition and state description into state transition and behavior data;
generating a transition matrix from the state transition and behavior data;
constructing a finite state machine to model device behavior in a device automation network; and
applying the finite state machine to a command map to remotely operate devices in the device automation network.

### Claim 2 (depends on 1)

The method of claim 1 wherein the the command map further comprises logic to translate communications with the device automation network and the finite state machine interpreter.

### Claim 3

A computing apparatus, the computing apparatus comprising:
a processor; and
a memory storing instructions that, when executed by the processor, configure the apparatus to:
a finite state machine interpreter receiving a transition and state description and a logic description from a user interface;
apply the transition and state description to a parser to parse the transition and state description into state transition and behavior data;
generate a transition matrix from the state transition and behavior data;
construct a finite state machine to model device behavior in a device automation network; and
apply the finite state machine to a command map to remotely operate devices in the device automation network.

### Claim 4 (depends on 3)

The computing apparatus of claim 3 wherein the the command map further comprises logic to translate communications with the device automation network and the finite state machine interpreter.