Computer graphics processing and selective visual display system – Display driving control circuitry – Controlling the condition of display elements
Reexamination Certificate
1999-12-07
2002-12-03
Sax, Steven (Department: 2174)
Computer graphics processing and selective visual display system
Display driving control circuitry
Controlling the condition of display elements
C345S215000
Reexamination Certificate
active
06489971
ABSTRACT:
TECHNICAL FIELD
The present invention relates in general to programmed data processing systems, and in particular to programmable deterministic finite state automata machines and graphical user interface (GUI) systems.
BACKGROUND INFORMATION
A finite state automation, also called a “finite state machine” or “transducer,” consists of a set of states, a set of input events, a set of output events, and a state transition function. The set of states includes an internal state. Some states may be designed as “terminal states.” The state transition function takes the current state in an input event and returns the new set of output events and the next state. The finite state machine can also be viewed as a function which maps an ordered sequence of input events onto a corresponding sequence of output events.
A deterministic finite state automation is one where each next state is uniquely determined by a single input event. A deterministic finite state automation is contrasted with a backtracking automation, where at each state there may be several possible actions and the only way to choose between them is to try each one and backtrack if that transition fails.
A deterministic finite state automation can be depicted in a variety of manners well-recognized within the mathematical art. One way in which a deterministic finite state automation might be depicted is in a table format. For example:
Current State
Exit Condition
Next State
Begin
Start
A
A
2
B
A
3
Exit
B
5
C
B
6
Exit
C
4
Exit
For greater clarity, a deterministic finite state automation may be depicted graphically as in
FIG. 1
, which illustrates the automation of the table. The first row of the table format is depicted by a Begin state
101
. The next state listed on the table is A
103
. Movement is made from the Begin state
101
to the A state
103
upon a starting condition
111
. Likewise, the diagram illustrates that state B
105
has exit conditions for
5
119
and
6
121
, and state C
107
has an exit condition
4
117
.
Finite state automata have been reduced to programming code, as demonstrated by FIG.
2
. Subroutines may be used to represent states. For example, subroutine A
210
may represent state A
103
on
FIG. 1
, or the first line in the table. While
FIG. 2
demonstrates iterative meta-code to implement the finite state automation shown in the table above and
FIG. 1
, those skilled in the art will appreciate that deterministic finite state automata may be implemented in a variety of programming languages to achieve results similar to the results obtained from the pseudo-code in FIG.
2
. Deterministic finite state automation are well-suited to being programmed in object-oriented languages. In fact, object-oriented languages have heretofore been considered ideal for computer implementation of the deterministic finite state automata model.
Those skilled in the art will appreciate, however, that, regardless of the language used, computer implementation of such deterministic finite state automata is often complex. The coding required to mimic a finite state automation within a computer requires special skills and training. It cannot be done by the ordinary user. Once a finite state automation is reduced to code, modifications to the finite state automation must be done by a programmer with specific training in the language in which the finite state automation is written. The instant invention addresses the complexities inherent in this system of deterministic finite state automata implementation and renders a more user-friendly system in which finite state automata may be easily implemented and modified.
SUMMARY OF THE INVENTION
The invention is a graphical-oriented editor that greatly simplifies the creation, testing, and subsequent revision of deterministic finite state automata. The editor is based upon the concept of functional units (FUs). Each FU represents a state in a deterministic finite state automation. Each FU is an object that facilitates the meaningful connection to other FUs to construct a larger logical entity which is an activity functional unit (AFU). Any AFU may be treated as a FU and nested.
By manipulating FUs and defining relationships between them graphically on the screen, the instant invention allows a user to build a complete program from FUs and AFUs. The resulting program is itself an AFU and can be combined with other AFUs and previously created AFUs to build large, complex programs.
Three control structures are necessary to implement to any program: sequence, branching, and iteration. Therefore, the instant invention provides for each of these features in order to permit construction of the most powerful and fully functional programs.
A database structure is also disclosed for facilitation of the display of the FU and the AFU in the graphical environment.
The development cycle for products built from AFUs through the instant graphical editor is considerably shorter than the development cycle for products constructed in a more traditional coding manner. Consequently, the cost of development is decreased. Short development cycles also enable development groups to more quickly respond to product management and marketing requirements.
The use of FUs and the graphic editor also considerably reduces the complexity of modifications to existing programs. Consequently, the cost of upkeep and maintenance of programs is decreased. Development groups are also able to then respond quickly to modification requirements.
The foregoing outlines broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter, which form the subject of the claims of the invention.
REFERENCES:
patent: 5117372 (1992-05-01), Petty
patent: 5561800 (1996-10-01), Sabatella
patent: 5652714 (1997-07-01), Peterson et al.
patent: 5671415 (1997-09-01), Hossain
patent: 5778059 (1998-07-01), Loghmani et al.
patent: 5805893 (1998-09-01), Burgess
patent: 5815153 (1998-09-01), Isensee et al.
patent: 5815715 (1998-09-01), Kucukcakar
patent: 5835914 (1998-11-01), Brim
patent: 5852436 (1998-12-01), Franklin et al.
patent: 5864819 (1999-01-01), De Armas
patent: 5870590 (1999-02-01), Kita et al.
patent: 5883639 (1999-03-01), Walton et al.
patent: 5910803 (1999-06-01), Grau et al.
patent: 5915115 (1999-06-01), Talati
patent: 6020889 (2000-02-01), Tarbox et al.
patent: 6046742 (2000-04-01), Chari
patent: 6070235 (2000-05-01), Cheong et al.
patent: 6101498 (2000-08-01), Scaer et al.
patent: 6122558 (2000-09-01), Barnes et al.
patent: 6141680 (2000-10-01), Cucchiara
Miller Mark Lee
Priddy Michael Scott
Donoughue Timothy M.
International Business Machines - Corporation
Sax Steven
Tyson Thomas E.
Winstead Sechrest & Minick P.C.
LandOfFree
Graphical programming environment for deterministic finite... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Graphical programming environment for deterministic finite..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphical programming environment for deterministic finite... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2922221