Finite state machine forming
AssigneeInternational Business Machines Corporation
InventorsAharon Abadi, Moria Abadi, Idan Ben-Harrush
Life of this patent
Estimating the term…
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.
Claims20
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.
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.
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.
Dependencies are inferred from the claim text.