System and method for finite state machine processing using acti

Details System and method for finite state machine processing using acti System and method for finite state machine processing using acti

1992-02-06

1994-05-31

Anderson, Lawrence E.

Boots, shoes, and leggings

3642383, 3642285, 3642548, 3642552, 3642557, 364DIG1, G06F 930, G06F 1516

Patent

active

053177576

ABSTRACT:
A common set of building block action modules perform specific tasks in the finite state machine and are strongly modular in structure. The set of building block action modules can be made up of modules for tasks generic to resource type and modules that are resource type independent. A finite state machine is created for each resource type to govern the steps of activation and deactivation of the resource. Each finite state machine, uniquely defines the new state and action processing for each resource type. To tie the building block action modules to each finite state machine, action vectors are created for each resource type. The action vector correlates a particular action selection by the finite state machine to the dispatching of one or more building block action modules. An action vector can contain a plurality of elements. Each of these elements identifies an action module to which control is passed and a function request pointer. The function pointer identifies the specific function to be performed by the designated action module. The building block action modules are invoked in the order of occurrence of the elements in the action vector.

REFERENCES:
patent: 4413251 (1983-11-01), Adler et al.
patent: 4507752 (1985-03-01), McKenna et al.
patent: 4631666 (1986-12-01), Harris et al.
patent: 4695977 (1987-09-01), Hansen et al.
patent: 4724521 (1988-02-01), Carron et al.
patent: 4727575 (1988-02-01), Hansen et al.
patent: 4802116 (1989-01-01), Ward et al.
patent: 4901232 (1990-02-01), Harrington et al.
patent: 4905181 (1990-02-01), Gregory
patent: 4965721 (1990-10-01), Holtey et al.
patent: 5029080 (1991-07-01), Otsuki
patent: 5105353 (1992-04-01), Charles et al.
patent: 5201048 (1993-04-01), Coulter et al.
"Cascading Content-addressable memories" by Tim Moors et al. IEEE Micro, vol. 12, Issue 3, pp. 56-66, Jun. 1992.
"VLSI implementation of routing tables: Tries and Cams" by Tong-Bi Pei et al. IEEE Infocom '91, pp. 515-524 vol. 2, Mar. 1991.
"Term indexing for retrieval by unification", by Yokota H. et al. IEEE Computer Soc. Press, pp. 313-320, May 1989.
"Trie Hashing with Controlled Load", by Witold A. Litwin et al. IEEE Transactions on software engineering vol. 17, No. 7, Jul. 1991.

Affiliated with

Also associated with

Rating

System and method for finite state machine processing using acti does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for finite state machine processing using acti, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for finite state machine processing using acti will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1635375