Distributable And Serializable Finite State Machine
AssigneeInternational Business Machines Corporation
InventorsJames R. Challenger, Louis R. Degenaro, James R. Giles, Paul Reed, Rohit Wagle
Life of this patent
Estimating the term…
Abstract
A distributable and serializable finite state machine and methods for using the distributable and serializable finite state machine are provided wherein finite state machine instance can be location-shifted, time-shifted or location-shift and time-shifted, for example by serializing and deserializing each instance. Each instance can be located-shifted between agents, and a persistent memory storage location is provided to facilitate both location-shifting and time-shifting. Finite state machine instances and the actions that make up each instance can be run in a distributed fashion among a plurality of agents.
Claims35
A method for utilizing finite state machines in a computing system, the method comprising:
- initiating on a first agent at least one instance of a finite state machine specification comprising a plurality of states and a plurality of transitions between the states;
- shifting the finite state machine instance from the first agent to a second agent.
A method for utilizing finite state machines in a computing system, the method comprising:
- initiating on a first agent at least one instance of a finite state machine specification comprising a plurality of states and a plurality of transitions between the states;
- removing the finite state machine instance from the first agent;
- saving the removed finite state machine instance in persistent storage;
- and
- holding the finite state machine instance in persistent storage for a period of time.
A method for utilizing finite state machines in a computing system, the method comprising:
- initiating on a first agent at least one instance of a finite state machine specification comprising a plurality of states and a plurality of transitions between the states;
- serializing said finite state machine instance in progress;
- and
- deserializing said finite state machine instance.
A computer-readable medium containing a computer-readable code that when read by a computer causes the computer to perform a method for utilizing finite state machines in a computing system, the method comprising:
- initiating on a first agent at least one instance of a finite state machine specification comprising a plurality of states and a plurality of transitions between the states;
- shifting the finite state machine instance from the first agent to a second agent.
A method for managing finite state machines in a computing system, the method comprising employing a distributed finite state machine control application program interface to perform at least one of:
- determining a set of finite state machine instances;
- selecting a target instance;
- forwarding a transition to a target instance;
- forwarding an event to a target instance;
- registering an instance;
- unregistering an instance;
- registering a transition event;
- and
- unregistering a transition event.
Dependencies are inferred from the claim text.