Patent Issued for Systems And Methods For Developing Policy Administration Systems Based Upon Finite State Machine Models (USPTO 10,535,102)

2020 JAN 29 (NewsRx) -- By a News Reporter-Staff News Editor at Insurance Daily News -- According to news reporting originating from Alexandria, Virginia, by NewsRx journalists, a patent by the inventors Norton, Joseph W. (Normal, IL); Kongara, Venkata R. (Bloomington, IL); Wheeler, Timothy J. (Normal, IL), filed on May 14, 2015, was published online on January 27, 2020.

The assignee for this patent, patent number 10,535,102, is State Farm Mutual Automobile Insurance Company (Bloomington, Illinois, United States).

Reporters obtained the following quote from the background information supplied by the inventors: “In the insurance field, a policy administration system is used to manage policies that an insurance company has written. A policy may be issued for any number of products or lines of business provided by the insurance company (e.g., vehicle insurance, home insurance, life insurance, etc.). Transactions made on the policy (e.g., changes to the policy such as renewal, cancellation, reinstatement, etc.) may be recorded and tracked by the policy administration system. In this regard, the policy administration system may act like a system of record for storing, organizing and maintaining various policy-related data generated by the insurance company.

“Existing policy administration systems may be typically implemented as several monolithic systems, each of which is responsible for a product or line of business. While these separate monolithic systems may have access to some globally available data, the systems themselves are essentially isolated from one another. This makes the sharing of data and information between the systems difficult. As a result, during transactions, separate processing operations may be needed in order to determine the impact of the transactions on all the separate systems. This in turn may render the performance of many existing policy administration systems slow and/or inefficient.”

In addition to obtaining background information on this patent, NewsRx editors also obtained the inventors’ summary information for this patent: “To improve system performance, policy administration systems may be designed and developed based upon finite state machine models. In this approach, instead of having separate monolithic systems, each and every insured household is modeled as a finite state machine. As a result, each household becomes a type of self-contained policy administration system that may be run and managed at the same time, thereby enabling the concurrent processing of insurance-related transactions in a fast, efficient and accurate manner.

“In one aspect, a computer-implemented method for developing a policy administration system based upon finite state machine models may be provided. The method may include defining, by one or more processors executing a processor-implemented instruction module, the policy administration system to comprise a plurality of households insured by an insurance company. The plurality of households may include at least a portion of all households insured by the insurance company. The method may also include modeling, by the processor-implemented instruction module, each of the plurality of households as a finite state machine, wherein each of the plurality of households is defined by a (i) set of states, (ii) a set of events, and/or (iii) a set of transition functions. The method may further include defining, by the processor-implemented instruction module, data that describe or relate to one or more insurance policies issued by the insurance company for each household, the data corresponding to the set of states for each household. Further, the method may include receiving, by the processor-implemented instruction module, one or more transactions for each household that operate on the data of each household, the one or more transactions corresponding to the set of events for each household. Still further, the method may include processing, by the processor-implemented instruction module, the one or more transactions for each household according to one or more transaction logics and/or one or more product rules for each household, the one or more transaction logics and product rules corresponding to the set of transition functions for each household. Additionally, the method may include causing, by the processor-implemented instruction module, a state transition for each household as a result of processing the one or more transactions for each household. Insurance policies may be adjusted and/or insurance-related activities may be performed based upon the state transition for each household and/or current modeling of an individual insured household/family. The method may include additional, fewer, or alternate actions, including those discussed elsewhere herein.

“In another aspect, a non-transitory computer-readable storage medium including computer-readable instruction to be executed on one or more processors of a system for developing a policy administration system based upon finite state machine models may be provided. The instructions when executed may cause the one or more processors to define, by a processor-implemented instruction module, the policy administration system to comprise a plurality of households insured by an insurance company. The plurality of households may include at least a portion of all households insured by the insurance company. The instructions when executed may also cause the one or more processors to model, by the processor-implemented instruction module, each of the plurality of households as a finite state machine, wherein each of the plurality of households is defined by a (i) set of states, (ii) a set of events, and/or (iii) a set of transition functions. The instructions when executed may further cause the one or more processors to define, by the processor-implemented instruction module, data that describe or relate to one or more insurance policies issued by the insurance company for each household, the data corresponding to the set of states for each household. Further, the instructions when executed may cause the one or more processors to receive, by the processor-implemented instruction module, one or more transactions for each household that operate on the data of each household, the one or more transactions corresponding to the set of events for each household. Still further, the instructions when executed may cause the one or more processors to process, by the processor-implemented instruction module, the one or more transactions for each household according to one or more transaction logics and/or one or more product rules for each household, the one or more transaction logics and product rules corresponding to the set of transition functions for each household. Additionally, the instructions when executed may cause the one or more processors to cause, by the processor-implemented instruction module, a state transition for each household as a result of processing the one or more transactions for each household. The instructions may also relate to managing, generating, and/or updating insurance policies for insured households based upon a current state of each household. The non-transitory computer-readable storage memory may include additional, fewer, or alternate computer-readable instructions, including those discussed elsewhere herein.

“In another aspect, a computer system for developing a policy administration system based upon finite state machine models may be provided. The system may include a data repository and a server including a memory having instructions for execution on one or more processors. The instructions, when executed by the one or more processors, may cause the server to define, by one or more processors executing one or more processor-implemented instruction modules, the policy administration system to comprise a plurality of households insured by an insurance company. The plurality of households may include at least a portion of all households insured by the insurance company. The instructions, when executed by the one or more processors, may also cause the server to model, by the one or more processors executing one or more processor-implemented instruction modules, each of the plurality of households as a finite state machine, wherein each of the plurality of households is defined by a (i) set of states, (ii) a set of events, and/or (iii) a set of transition functions. The instructions, when executed by the one or more processors, may further cause the server to store, by the one or more processors executing one or more processor-implemented instruction modules, each household in the data repository. Further, the instructions, when executed by the one or more processors, may cause the server to define, by the one or more processors executing one or more processor-implemented instruction modules, data that describe or relate to one or more insurance policies issued by the insurance company for each household, the data corresponding to the set of states for each household. Still further, the instructions, when executed by the one or more processors, may cause the server to receive, via a network connection, one or more transactions for each household that operate on the data of each household, the one or more transactions corresponding to the set of events for each household. Moreover, the instructions, when executed by the one or more processors, may cause the server to process, by the one or more processors executing one or more processor-implemented instruction modules, the one or more transactions for each household according to one or more transaction logics and one or more product rules for each household, the one or more transaction logics and product rules corresponding to the set of transition functions for each household. Additionally, the instructions, when executed by the one or more processors, may cause the server to cause, by the one or more processors executing one or more processor-implemented instruction modules, a state transition for each household as a result of processing the one or more transactions for each household to facilitate managing and/or updating insurance policies. The computer system may include additional, fewer, or alternate instructions for execution on the one or more processors, including those discussed elsewhere herein.

“Advantages will become more apparent to those skilled in the art from the following description of the preferred embodiments which have been shown and described by way of illustration. As will be realized, the present embodiments may be capable of other and different embodiments, and their details are capable of modification in various respects. Accordingly, the drawings and description are to be regarded as illustrative in nature and not as restrictive.”

The claims supplied by the inventors are:

“What is claimed:

“1. A computer-implemented method for developing a policy administration system based upon finite state machine models, the method comprising: defining, by one or more processors, the policy administration system to comprise a plurality of households insured by an insurance company, wherein the plurality of households includes at least a portion of all households insured by the insurance company; modeling, by the one or more processors, a data structure representing each of the plurality of households as a finite state machine-based household, wherein each of the plurality of finite state machine-based households is defined by (i) a set of states including at least a first state and a second state, (ii) a set of events that operates on the set of states, and (iii) a set of transition functions that maps a state transition when one of the events operates on one of the states, wherein each of the plurality of finite state machine-based households supports dynamic functions including one or more of a split function, merge function, upgrade or downgrade function, backup function, restore function or health check function; defining, by the one or more processors, data that describe or relate to at least two insurance policies issued by the insurance company for each finite state machine-based household, the data corresponding to the set of states for each finite state machine-based household represented in the data structure; receiving, by the one or more processors, one or more transactions for each finite state machine-based household that operate on the data of each finite state machine-based household, the one or more transactions corresponding to the set of events for each finite state machine-based household represented in the data structure; processing, by the one or more processors, the one or more transactions concurrently for the data structure according to one or more transaction logics and one or more product rules for each finite state machine-based household, the one or more transaction logics and product rules corresponding to the set of transition functions for each finite state machine-based household, wherein the one or more transaction logics specify actions that need to be executed in order to process a transaction, and the one or more product rules specify guidelines that determine whether a transaction obeys a set of regulations as defined or required for a product or line of business; and updating, by the one or more processors, the first state to the second state in accordance with the state transition for each finite state machine-based household represented in the data structure as a result of processing the one or more transactions for each finite state machine-based household if one or more conditions that define the state transition is true to facilitate managing, updating, and/or generating insurance policies, the first state indicating a state of the data of each finite state machine-based household before the processing of the one or more transactions and the second state indicating a state of the data of each finite state machine-based household after the processing of the one or more transactions.

“2. The computer-implemented method of claim 1, wherein the one or more insurance policies are issued for products or lines of business provided by the insurance company including one or more of a vehicle insurance, home insurance, health insurance, long-term care insurance, pet insurance, or life insurance.

“3. The computer-implemented method of claim 1, wherein the one or more transactions specify one or more operations that create, lookup, modify, terminate, cancel, renew, reinstate or service a policy.

“4. The computer-implemented method of claim 1, wherein each of the plurality of finite state machine-based households implements a user interface that allows a user to access the one or more insurance policies associated with each finite state machine-based household as well as the products or lines of business provided by the insurance company.

“5. The computer-implemented method of claim 1, wherein the data, the one or more transaction logics and the one or more product rules of each finite state machine-based household are stored locally in each finite state machine-based household.

“6. A non-transitory computer-readable storage medium including computer-readable instruction to be executed on one or more processors of a system for developing a policy administration system based upon finite state machine models, the instructions when executed causing the one or more processors to: define the policy administration system to comprise a plurality of households insured by an insurance company, wherein the plurality of households includes at least a portion of all households insured by the insurance company; model a data structure representing each of the plurality of households as a finite state machine-based household, wherein each of the plurality of finite state machine-based households is defined by (i) a set of states including at least a first state and a second state, (ii) a set of events that operates on the set of states, and (iii) a set of transition functions that maps a state transition when one of the events operates on one of the states represented in the data structure, wherein each of the plurality of finite state machine-based households supports dynamic functions including one or more of a split function, merge function, upgrade or downgrade function, backup function, restore function or health check function; define data that describe or relate to at least two insurance policies issued by the insurance company for each finite state machine-based household, the data corresponding to the set of states for each finite state machine-based household represented in the data structure; receive one or more transactions for each finite state machine-based household that operate on the data of each finite state machine-based household, the one or more transactions corresponding to the set of events for each finite state machine-based household represented in the data structure; process the one or more transactions concurrently for the data structure according to one or more transaction logics and one or more product rules for each finite state machine-based household, the one or more transaction logics and product rules corresponding to the set of transition functions for each finite state machine-based household, wherein the one or more transaction logics specify actions that need to be executed in order to process a transaction, and the one or more product rules specify guidelines that determine whether a transaction obeys a set of regulations as defined or required for a product or line of business; and update the first state to the second state in accordance with the state transition for each finite state machine-based household represented in the data structure as a result of processing the one or more transactions for each finite state machine-based household if one or more conditions that define the state transition is true to facilitate managing, updating, and/or generating insurance policies, the first state indicating a state of the data of each finite state machine-based household before the processing of the one or more transactions and the second state indicating a state of the data of each finite state machine-based household after the processing of the one or more transactions.

“7. The non-transitory computer-readable storage medium of claim 6, wherein the one or more transactions specify one or more operations that create, lookup, modify, terminate, cancel, renew, reinstate or service a policy.

“8. A computer system for developing a policy administration system based upon finite state machine models, the system comprising: a data repository; and a server, including a memory having instructions for execution on one or more processors, wherein the instructions, when executed by the one or more processors, cause the server to: define, by one or more processors, the policy administration system to comprise a plurality of households insured by an insurance company, wherein the plurality of households includes at least a portion of all households insured by the insurance company; model, by the one or more processors, a data structure representing each of the plurality of households as a finite state machine-based household, wherein each of the plurality of finite state machine-based households is defined by (i) a set of states including at least a first state and a second state, (ii) a set of events that operates on the set of states, and (iii) a set of transition functions that maps a state transition when one of the events operates on one of the states, wherein each of the plurality of finite state machine-based households is configured to support dynamic functions including one or more of a split function, merge function, upgrade or downgrade function, backup function, restore function or health check function; store, by the one or more processors, each finite state machine-based household in the data repository; define, by the one or more processors, data that describe or relate to at least two insurance policies issued by the insurance company for each finite state machine-based household, the data corresponding to the set of states for each finite state machine-based household represented in the data structure; receive, via a network connection, one or more transactions for each finite state machine-based household that operate on the data of each finite state machine-based household, the one or more transactions corresponding to the set of events for each finite state machine-based household represented in the data structure; process, by the one or more processors, the one or more transactions concurrently for the data structure according to one or more transaction logics and one or more product rules for each finite state machine-based household, the one or more transaction logics and product rules corresponding to the set of transition functions for each finite state machine-based household, wherein the one or more transaction logics specify actions that need to be executed in order to process a transaction, and the one or more product rules specify guidelines that determine whether a transaction obeys a set of regulations as defined or required for a product or line of business; and update, by the one or more processors, the first state to the second state in accordance with the state transition for each finite state machine-based household represented in the data structure as a result of processing the one or more transactions for each finite state machine-based household if one or more conditions that define the state transition is true to facilitate managing, updating, and/or generating insurance policies, the first state indicating a state of the data of each finite state machine-based household before the processing of the one or more transactions and the second state indicating a state of the data of each finite state machine-based household after the processing of the one or more transactions.

“9. The computer system of claim 8, wherein the one or more transactions specify one or more operations that create, lookup, modify, terminate, cancel, renew, reinstate or service a policy.

“10. The computer system of claim 8, wherein each of the plurality of finite state machine-based households is configured to implement a user interface to allow a user to access the one or more insurance policies associated with each finite state machine-based household as well as the products or lines of business provided by the insurance company.

“11. The computer system of claim 8, wherein the data, the one or more transaction logics and the one or more product rules of each finite state machine-based household are stored locally in each finite state machine-based household.”

For more information, see this patent: Norton, Joseph W.; Kongara, Venkata R.; Wheeler, Timothy J. Systems And Methods For Developing Policy Administration Systems Based Upon Finite State Machine Models. U.S. Patent Number 10,535,102, filed May 14, 2015, and published online on January 27, 2020. Patent URL: http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&Sect2=HITOFF&d=PALL&p=1&u=%2Fnetahtml%2FPTO%2Fsrchnum.htm&r=1&f=G&l=50&s1=10,535,102.PN.&OS=PN/10,535,102RS=PN/10,535,102

(Our reports deliver fact-based news of research and discoveries from around the world.)