# US 2015/0106303 A1 · Finite state machine forming

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

- Number: US 2015/0106303 A1
- Document ID: US20150106303A1
- Status: Published application
- Kind: A1
- Application number: 14/052,778
- Filed: 2013-10-14
- Published: 2015-04-16
- Earliest claimed: 2013-10-14
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Aharon Abadi; Moria Abadi; Idan Ben-Harrush
- Web page: https://patentgrep.com/patent/US20150106303A1

## CPC

- G06N 5/02: Knowledge representation; Symbolic representation
- G06F 9/4498: {Finite state machines}
- G06F 9/451: Execution arrangements for user interfaces
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Techniques for representing a finite state machine forming are described herein. The techniques include a method that identifies screens of a computing program. The method may include correlating the identified screens with states of a finite state machine. Events indicating transition between the identified screens may be determined as well as data flow associated with the events. The method may include forming a graph representing the screens, events, and data flow in the finite state machine.

## Claims

### Claim 1

A method, comprising:
identifying screens of a computing program;
correlating the identified screens with states of a finite state machine;
determining events indicating transition between the identified screens;
determining data flow between the screens associated with the transition; and
forming a graph representing the screens, events, and data flow in the finite state machine.

### Claim 2 (depends on 1)

The method of claim 1, wherein the computing program is to be implemented on a mobile computing device.

### Claim 3 (depends on 1)

The method of any of claims 1, wherein the identified screens are represented as nodes in the graph and data flow is represented as edges of the graph.

### Claim 4 (depends on 1)

The method of claim 1, wherein the events are a result of:
user actions;
incoming communication; or
any combination of the above

### Claim 5 (depends on 1)

The method of claim 1, comprising analyzing the graph representing the screens, events, and data flow by an analytical module.

### Claim 6 (depends on 5)

The method of claim 5, wherein the analyzing comprises:
optimization;
refactoring; and
validation.

### Claim 7 (depends on 1)

The method of claim 1, wherein the screens are displayed on a graphical user interface of a computing device.

### Claim 8

A computing device, comprising:
a storage device;
a processor;
the storage device having instructions that when executed by the processor, cause the computing device to:
identify screens of a computing program;
correlate the identified screens with states of a finite state machine;
determine events indicating transition between the identified screens;
determine data flow associated with the transition; and
form a graph representing the screens, events, and data flow in the finite state machine.

### Claim 9 (depends on 8)

The computing device of claim 8, wherein the computing program is to be implemented on a mobile computing device.

### Claim 10 (depends on 8)

The computing device of any of claims 8, wherein the identified screens are represented as nodes in the graph and data flow is represented as edges of the graph.

### Claim 11 (depends on 8)

The computing device of claim 8, wherein the events are a result of:
user actions;
incoming communication; or
any combination of the above

### Claim 12 (depends on 8)

The computing device of claim 8, comprising analyzing the graph representing the screens, events, and data flow by an analytical module.

### Claim 13 (depends on 12)

The computing device of claim 12, wherein the analyzing comprises:
optimization;
refactoring; and
validation.

### Claim 14 (depends on 8)

The computing device of claim 8, wherein the screens are displayed on a graphical user interface of a computing device.

### Claim 15

A computer program product for forming a finite state machine, the computer product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
identifying, by the processor, screens of a computing program;
correlating, by the processor, the identified screens with states of a finite state machine;
determining, by the processor, events indicating transition between the identified screens;
determining, by the processor, data flow associated with the transition; and
forming, by the processor, a graph representing the screens, events, and data flow in the finite state machine.

### Claim 16 (depends on 15)

The computer program product of claim 15, wherein the computing program is to be implemented on a mobile computing device.

### Claim 17 (depends on 15)

The computer program product of claim 15, wherein the identified screens are represented as nodes in the graph and data flow is represented as edges of the graph.

### Claim 18 (depends on 15)

The computer program product of claim 15, wherein the events are a result of:
user actions;
incoming communication; or
any combination of the above

### Claim 19 (depends on 15)

The computer program product of claim 15, comprising analyzing the graph representing the screens, events, and data flow by an analytical module wherein the analyzing comprises:
optimization;
refactoring; and
validation.

### Claim 20 (depends on 15)

The computer program product of claim 15, wherein the screens are displayed on a graphical user interface of a computing device.
