Extensibility of business process and application logic
8 claims: 2 independent, 6 dependent
- 1A computer implemented method comprising first, second, third, fourth and fifth processes, the first process comprising:- executing (902) a first program component (510) for performing a computational task, - upon completion of the execution of the computational task, generating a request to set a status indicating completion of the computational task by the first program component, - sending the request from the first program component to a state machine (806), the second process comprising: - receiving the request from the first program component by the state machine, - in response to receipt of the request from the first program component performing a write database access for writing (906) a precursor (preX) of the status into a database table (810) by the state machine, - performing (908) a database query in order to fetch a condition (816) assigned to the computational task from a database table (814) by the state machine, - determining (910) whether the database query did return the condition, - if the database query did return the condition, then performing: a) starting (914) a timer (804), b) performing (916) a database access for reading the at least one parameter value from a database table (814), c) evaluating (918) the condition using at least one parameter value, d) determining (920) whether the condition is true, e) if the condition is true, performing a write database access in order to write the status into the database table (810) and resetting (922) the timer, f) if the condition is not true, invoking (924) the third process and going back to step b), - if the database query did not return the condition, performing (912) a write database access in order to write the status into the database table (810), the third process comprising: - executing (928) a third program component for performing an additional computational task, the additional computational task resulting in a modification of at least one of the parameter values, - performing (930) a write database access by the third program component for writing the at least one modified parameter value to the database table (814), the fourth process comprising: - repetitively reading (932) the timer value of the timer by a monitoring program component (802), - determining (934) whether the timer value has reached or is above a predefined threshold value, and if so generating a signal being indicative of the fulfillment of a time-out condition to prevent an endless loop by the monitoring program component, the fifth process comprising: - repetitively performing a read operation to the database table (810) for determining whether the status has been set, - if the status has been set executing a second program component (550) for performing a further computational task.
- 4A computer system comprising a first program component (510), a second program component (550), a third program component, a state machine (806), a monitoring program component (802), a system clock (808) and a timer (804) using the system clock, storage means (520) for storing a database, and one or more processors (800) for executing the first, second, third, and monitoring program components, the state machine and the timer, the one or more processors being operable to perform a method in accordance with any one of the preceding claims.
Independent claims2
78 paragraphs, as filed
<u>BACKGROUND</u>
0001Organizations use enterprise resource planning (ERP), customer relationship management (CRM), and other business management systems to manage business processes and workflows. These systems may include various subcomponents to manage different tasks in a workflow. For example, an order management system may generate an order form, supply the form to a prospective purchaser, and process the completed form submitted by the purchaser. A delivery management system may instruct an entity to initiate delivery of the ordered items in the completed order form and track the status of the order items throughout the delivery process.
0002Each of these subcomponents may be wholly independent from each other, in that the subcomponents may not directly communicate with each other. Thus, in the above example, the order management system may not directly communicate with the delivery management system. Although these subcomponents may not directly communicate, a business workflow may still require tasks and functions to be completed in a specific order. For example, an order form may have to be completed and processed before goods may be delivered.
0003To preserve order and continuity in the workflow, each of the subcomponents may update a status field of a object in a database. Once a subcomponent has completed its assigned tasks on an object, the subcomponent may update the status field for the object in the database accordingly. A second subcomponent in the workflow may be configured to check the status field of objects in the database and begin processing objects with a status field indicating that the prior subcomponent in the workflow has been completed. This ensures that the second subcomponent is not processed out of sequence.
0004<nplcit id="ncit0001" npl-type="s" url="http://www.brianloesgen.com/blog/2005/10/27/a-messaging-based-state-machine-desigin-pattern-using-biztalk.html?pringerFriedly=true"><text>"A messaging-based State Machine Design Pattern, using BizTalk Server", Internet citation, 27 October 2005, pages 1-3, XP002666195 retrieved from the URL http://www.brianloesgen.com/blog/2005/10/27/a-messaging-based-state-machine-desigin-pattern-using-biztalk.html?pringerFriedly=true [revised on 2011-12-20</text></nplcit>] describes a publish/subscribe mechanism according to which a message has a Status field which is promoted. The Status field becomes a routable field making it visible to the publish/subscribe mechanism.
<u>Summary</u>
0005The invention provides an improved computer implemented method, computer system and computer program product for execution of computational tasks in a highly flexible and adaptable manner facilitating loose coupling between the system components as claimed in the independent claims. Embodiments of the invention are given in the dependent claims.
0006A 'state machine' as understood herein is a computer program or program component being executed by one or more microprocessor and that is composed of a finite number of states, transitions between those states, and actions that are performed when certain conditions are met. The state machine has an internal memory and an input for receiving a signal, such as a request.
0007The term 'loose coupling' as understood herein comprises any form of coupling between program components that enables asynchronous sequential execution of the program components for implementation of a service oriented architecture, i.e. the completion of the execution of a first program component does not directly start execution of a second program component but the start of the execution of the second program component is triggered otherwise by merely using the completion of the first program component as a necessary condition.
0008The term 'web service' as understood herein comprises the web services architecture as specified by the W3C working group.
0009The term 'web services push message' as understood herein comprises any push service implemented by a web service.
0010Embodiments of the invention are particularly advantageous as a degree of freedom is provided to perform an extension of the computational task performed by the first program component while preserving the option of not performing such an extension; this degree of flexibility may be accomplished by minimal modifications of the core system. Furthermore, this additional flexibility causes only a minimal delay.
0011The flexibility is provided by coupling the first program component performing the computational task and the second program component that performs a consecutive further computational task by means of the state machine that loosely couples these first and second program components through a database in which a status and a precursor of the status that precedes the status are stored. This facilitates delivery of a standardized computer system to a customer which may be adapted to the customer's needs by adding an extension of the computational task performed by the first program component with minimal adaptations to the core system and providing loose coupling between the second program component and the first program component.
0012In accordance with embodiments of the invention a data processing system is provided that is constituted by multiple computer systems that are arranged in a cascade. This enables distributed data processing using a service oriented architecture for maximum flexibility, load distribution and avoidance of a single point of failure.
0013Embodiments of the invention are particularly advantageous as user-specific process modifications of existing process management systems that are independent of system upgrades and integrations are facilitated.
<u>BRIEF DESCRIPTION OF THE DRAWINGS</u>
0014<ul id="ul0001" list-style="none"><li><figref idref="f0001">FIG. 1a</figref> shows an existing process management workflow.</li><li><figref idref="f0002">FIG. 1b</figref> shows an exemplary embodiment of the invention.</li><li><figref idref="f0003">FIG. 2</figref> shows exemplary approval process workflow in an embodiment.</li><li><figref idref="f0004">FIG. 3</figref> shows exemplary status changes in a hierarchical approval process workflow.</li><li><figref idref="f0005">FIG. 4</figref> shows an exemplary embodiment of the invention in a order management process workflow.</li><li><figref idref="f0006">FIG. 5</figref> shows an exemplary flow of data between systems in an embodiment.</li><li><figref idref="f0007">FIG. 6</figref> shows an exemplary method in an embodiment.</li><li><figref idref="f0008">FIG. 7</figref> shows an embodiment of systems coupled to each other through a network.</li><li><figref idref="f0009">FIG. 8</figref> shows a block diagram of an embodiment of a computer system of the invention,</li><li><figref idref="f0010">FIG. 9</figref> shows a flowchart being illustrative of computational processes that are performed by the computer system of <figref idref="f0009">Fig. 8</figref>,</li><li><figref idref="f0011">FIG. 10</figref> is a block diagram of a data processing system comprising multiple cascaded computer systems of the type of <figref idref="f0009">Fig. 8</figref>.</li></ul>
0015Throughout the following description of the various embodiments of the invention identical reference numerals are used for like or identical elements.
<u>DETAILED DESCRIPTION</u>
0016<figref idref="f0001">FIG. 1a</figref> shows a process management workflow 100. In this workflow, a first program A 110 may be designed to perform a sequence of tasks, such as initiating a first task 101 in response to a stimulus, performing the first task 102 on an object, and then updating the status in a status field 141 of the object. The status field 141 of the object may be updated to indicate whether the first task was successfully completed 170.
0017Program A 110 may be independent of the second program, program B 180, which may be designed to perform a sequence of other tasks, such as checking the status field 141 of objects, and initiating and completing a second task 105 when the status field 141 indicates that program A 110 was successfully completed. This may ensure that program B 180 is not completed before program A 110 and that the processing order of tasks in the workflow is maintained even though the programs A 110 and B 180 do not directly communicate.
0018Many existing business process management systems include the functionality shown in <figref idref="f0001">FIG. 1a</figref>. However, some users of these existing systems may have additional workflow processes that they would like to perform that are not included in the generic system. For example, users in some countries may have additional locality-specific compliance checks that need to be performed between different tasks and programs in the system. Other users may have specific processes unique to their organization that they would like to perform.
0019Users wanting to include additional user-specific processes have had to modify the existing systems to include the additional functionality. However, these user-specific modifications have also caused complications when upgrading business management systems or when integrating other systems with the business management systems. Complications may occur because the upgrading and/or integration process may either overwrite the user-specific modifications or may result in an incompatibility between the functionality offered in the new systems with the modifications previously made to the existing system.
0020A core system may include different program components to perform tasks in a workflow sequence according to a status of an object recorded in a database status field. In an embodiment of the invention, the recorded status of a task may be modified from a completed status to a partially completed status when the task in the core system is successfully completed. An action management system may be used to perform additional processes and tasks on objects with the partial completion status. Once the additional processes and tasks are completed, the recorded status may be further modified to the original completed status so that other program components in the core system depending on the original completed status may continue to operate.
0021<figref idref="f0002">FIG. 1b</figref> shows an exemplary embodiment of the invention. In this embodiment, a core system 160 may include different program components 111, such as programs A and B that perform different tasks in a workflow. Each of the programs A and B 111 may be independent of each other in that the programs A and B do not directly communicate. To ensure that tasks are processed sequentially according to a predetermined workflow, a status field 170 of an object may be updated when each program is successfully completed on the object. Instead of updating the status field 170 to record the successful completion of program A 111 on an object with the exemplary status "Program A Done", the core system may modified to record the successful completion of Program A 111 on the object with a partial completion status, such as "Program A Action Issued" 191. In some instances, this may be the only modification to the core system 160 necessary to use the claimed invention. By minimizing the modifications to the core system 160, modifications, upgrades, and additions to the core system 160 may be more readily and efficiently integrated.
0022A separate status/action management system 190 may also be included in an embodiment. The action management system 190 may include functionality to check on the status of object and perform additional processing on objects depending on the current status of the object. For example, the action management system 190 may use push or pull technologies, such as HTTP server pushes, Java® pushlets, and RSS feeds, to check for status field updates.
0023Objects with different statuses may cause different processes to be performed. For example, once the action management system 190 becomes aware that an objects has the modified program A completion status "Program A Action Issued" 190, the action management system 190 may initiate a series of additional processes, shown as extension steps 1 to N 192. Once these additional extensions steps 1 to N 192 have been successfully completed, the action management system 190 may change the status field of the object back to the original completion status "Program A Done" 170 so that the next program B 111 in the workflow, which may only initiate for objects with the original completion status "Program A Done" 170, may begin. Although the status field may be updated with a variety of status indicators, using the original status indicator triggering the next program in the core system 160 workflow eliminates the need to reconfigure the next program in the workflow to respond to a revised status indicator.
0024In some embodiments, the action management system may include an approval process to determine when an object's status should reflect full completion of a program to enable a subsequence program in a workflow to commence. <figref idref="f0003">FIG. 2</figref> shows exemplary approval process workflow in an embodiment. In this embodiment, when program A 111 in the core system 160 has finished performing its processes on object 130, it may send a partial completion "Action Issued" status to be stored in status field 141 of object 130 in a database.
0025In box 210, an action management system 190 may synchronously or asynchronously check for updated status field in the database or receive updated status field information from the database.
0026After checking the status fields in the database for objects with a partial completion status, in box 215 the system may determine whether the object needs further approval before the next program may commence. This determination may be through a programming logic specifying conditions requiring further approval, such as a request for expenditures over $X require approval. Other forms of programming logic, such as, a lookup table may be used to match objects, programs, and/or other approval criteria to determine whether additional approval is needed.
0027If no further approval is necessary, the status field 141 of the object 130 in the database may be updated to indicate that the object has been approved and/or approval is not necessary for the next program, program B 111, in the sequence to commence.
0028If, however, additional approval is necessary, in box 220, the system may follow a set of preprogrammed process steps to obtain the necessary approval. For example, if the approval process requires obtaining a permit, license, or other form of regulatory or supervisory approval, the system may electronically: extract the data required to obtain the approval from the organization's computing systems and/or databases, structure the data in a format recognized by the third party approver, send the structured data to the third party approver, and process a received decision of the third party approver.
0029If the processed decision indicates that the request for approval has been rejected, then in box 230, the action management system 190 may instructions to the database to update the status field 141 of the object 130 to rejected. If the processed decision indicates that the request has been approved, then in box 225 the action management system 190 may instruct the database to update the status field 141 of the object 130 to indicate approval. Instead of merely recording approval or rejection, the action management system 190 may also be configured to store additional data received from a third party approver in the database or other organizational computing system. For example, if the third party approver send an approval number, confirmation code, or license number, instead of or in addition to an express approval, the action management system 190 may be configured to extract this information from the response and update the organization's computing systems with the information.
0030<figref idref="f0004">FIG. 3</figref> shows exemplary status changes in a hierarchical approval process workflow of an embodiment including first and second level approval fields 310 and 350, respectively. In box 301, the approval process system may be reset. The approval status field 310 may be initially set in preparation 311, as preliminary steps of a program are executed. Once steps in the process requiring approval have been reached, an approval request may be submitted for approval.
0031After submission, the approval request may be electronically processed, and a decision may be made through a lookup table and/or other processing logic whether additional approval is necessary. If no additional approval is necessary, the status field 310 may be updated to indicate Approval Not Necessary 313 and the approval process may terminate. If additional approval is necessary, the approval request may be forwarded to the appropriate approval authority, which may be determined through the aforementioned processing logic. The status field 310 may be updated to indicate that the approval is underway 314.
0032If the first approval authority approves 315 the request, in box 316 the approval may be recorded in the status field of the object in the database. The aforementioned processing logic may be used to determine whether additional approval is necessary. If additional approval is needed, then in box 352, a request for additional approval may be sent to the designated secondary approval authority. The second approval status field 350 may be changed from an initial value 351 to reflect the in approval 353 status. Once the secondary approver approves the request 354, the status may be updated to approved 355, which may result in the processing logic 317 to update the status of the approval field 310 to approved 318.
0033If the secondary approver rejects 356 the request, then the second approval status field 350 may be changed to rejected. A rejection process 319 may update the status 310 to rejected 320 when either the second approval status field is rejected or the first approver rejects the request.
0034<figref idref="f0005">FIG. 4</figref> shows an exemplary embodiment of the invention in an order management process workflow 400. In this embodiment, once an order processing program 410 has finished processing an electronic order for goods or services, the program 410 may send instructions to a database to update the status field 141 of the corresponding order object 130 to a partially complete status, such as order processed.
0035In box 420, the action management system 190 may periodically check the status field 141 of objects 130 in the database. When the action management system 190 identifies objects with status fields 141 indicating order processed, the action management system 190 may retrieve data relating to the order from the organization's computing systems, restructure the information into a third-party compatible format, and send the data to the third party for further processing 425.
0036For example, the action management system may extract credit card information and billing information, restructure the information into format required by a credit card processor, and send the information to the credit card processor. Alternatively, the action management system may extract order information, restructure the order information in a format required by a regulatory authority, and send the information to the regulatory authority to obtain a license, permit, or other authorization.
0037The system may wait 430 for a response from the entity to whom the extracted data was sent. Once a response is received, data included by the entity in the response may be stored in an organization's computing systems and the status of the object in the database may also be updated 435. For example, if a processed order was sent to a third party for approval, the third party may send back an authorization number 442, in this case 12345, and a name of a person approving the order 443, in this case John Doe. This information, along with the date 441 the approval was received may also be stored in corresponding fields of the object 130 in the database. Additionally, the status field 141 of the object 130 may also be updated to indicate that the order was approved.
0038Once the status field 141 of the object 130 indicates that the order has been approved, the logic in the workflow 400 may enable the order fulfillment program 490 to commence in order to begin preparing and shipping the order to the customer.
0039<figref idref="f0006">FIG. 5</figref> shows an exemplary flow of data between systems in an embodiment. A core system 160 may include two or more program components, including first and second components 510 and 520. Each of the program components may be independent of each other and may not directly communicate with each other.
0040The first program component may send an update status of an object 501 to a database system 520 when the first program component successfully processes the object. An action management system 190 may periodically check or receives status updates 502 from the database system 520. When the action management system 190 identifies objects with a status indicating that the first program component 510 has successfully completed, the action management may retrieve data 503 related to the first program component 510 from the database system 520.
0041In some embodiments where the action management system 190 is configured to interact with third party systems, the action management system 190 may reformat the data and send the data 504 to a third party system 540. The third party system may invoke a service to further process the data sent from the action management system 190. Once the third party system 540 has finished its processing on the data, it may send a result of the further processing to the action management system. The action management system may receive the result 505, and then send the result and a status update 506 based on the result to the database system 520 to be stored.
0042The action management system 190 may also perform other processing functions on objects and send updates to the database system 520 when the updates are complete.
0043The second program component 550 may periodically send update requests to or receive update requests from the database system 520 to determine whether the status of any objects have been updated by the action management system 190 to indicate successful completion of any processing functions on the object by the action management system 190. Once the second program component 550 identifies objects with a status indicating successful completion of processing functions, the second component 550 may begin executing its processing functions on the identified objects.
0044<figref idref="f0007">FIG. 6</figref> shows an exemplary method in an embodiment. In box 610, a first program in a core system may be executed. The first program may apply processing functions to an object in order to complete a first task in a workflow involving the object.
0045In box 620, a status field of the object in a database may be set to partially complete when the first program is successfully completed.
0046In box 630, an action management system 190 may periodically check the status fields of object in the database and perform additional, user-customized processing functions on the objects with a partially complete status set by the first program.
0047In some embodiments, where the additional processing functions includes multiple extension steps, in box 631 the multiple extension step functions may be iteratively executed and in box 632 the status field of the object may be conditionally updated after each extension step is executed.
0048In box 640, the action management system 190 may set the object status to complete when the extension sets are finished.
0049In box 650, a second program in the core system may check on or receive updates of the status of objects in the database. The second program may apply its processing functions on objects having a complete status set by the action management system.
0050<figref idref="f0008">FIG. 7</figref> shows an embodiment of an action management system 190 coupled to a core system 160, database system 520, and enterprise or third party system 540 through a network 750. In an embodiment, the core system 160 may include two or more programming components 111 (shown as program components A and B). Each of the program components may be on separate, independent computing systems forming a core system, or the components 111 may be consolidated or integrated into a single core system 160.
0051The third party system 540 may be connected to a firewall system 740 that may prevent the third party system 540 from directly accessing other systems of the organization, including the action management system 190, core system 160, and database system 520. If the third party system 540 is under the control of the organization or is managed by a trusted third party, then it may bypass the firewall system 740 so that it may directly access the other systems of the organization.
0052Each of the systems in <figref idref="f0008">FIG. 7</figref> may contain a processing device 702, memory 703 containing a database 705, and an input/output interface 704, all of which may be interconnected via a system bus. In various embodiments, each of the systems 190, 160, 740, 540, 111, and 520 may have an architecture with modular hardware and/or software systems that include additional and/or different systems communicating through one or more networks. The modular design may enable a business to add, exchange, and upgrade systems, including using systems from different vendors in some embodiments. Because of the highly customized nature of these systems, different embodiments may have different types, quantities, and configurations of systems depending on the environment and organizational demands.
0053In an embodiment, memory 803 may contain different components for retrieving, presenting, changing, and saving data. Memory 803 may include a variety of memory devices, for example, Dynamic Random Access Memory (DRAM), Static RAM (SRAM), flash memory, cache memory, and other memory devices. Additionally, for example, memory 803 and processing device(s) 802 may be distributed across several different computers that collectively comprise a system.
0054Processing device 802 may perform computation and control functions of a system and comprises a suitable central processing unit (CPU). Processing device 802 may comprise a single integrated circuit, such as a microprocessing device, or may comprise any suitable number of integrated circuit devices and/or circuit boards working in cooperation to accomplish the functions of a processing device. Processing device 802 may execute computer programs, such as object-oriented computer programs, within memory 803.
0055<figref idref="f0009">Fig. 8</figref> shows a block diagram of a computer system 160 that is analogous to the core systems 130 and 160 of the <figref idref="f0006">Fig. 5</figref> and <figref idref="f0008">Fig. 7</figref> embodiments. The computer system 160 comprises storage means 520 that may implement a database/storage system 520 analogous to the embodiments of <figref idref="f0006">Figs. 5</figref> and <figref idref="f0008">7</figref>.
0056The computer system 160 has at least one microprocessor 800 for execution of the computer programs P1, P2, P3, a monitoring program 802, a timer 804 and a state machine 806.
0057The program P1 is analogous to program A, program P2 is analogous to program B and program P3 is analogous to extension steps 1 to N of the previous embodiments.
0058Further, the computer system 160 has a system clock 808 that provides a time reference for the timer 804.
0059The storage means 520 serves for storage of a database that comprises various database tables such as database tables 810, 812 and 814.
0060The database table 810 serves for storage of a status X that indicates completion of the execution of program P1 and of program P3 if execution of program P3 is required. Storage of the status X in the database table 810 is a necessary precondition for starting execution of program P2. Before the status X can be set a precursor of this status 'preX' needs to be set in the database table 810.
0061If conditional execution of the extension provided by the program P3 is desired, a respective condition 816 needs to be stored in the database table 812. The condition 816 may have the form of a Boolean term and may require one or more input parameters for evaluation of the condition 816. Evaluation of the condition 816 may return the value 'true' or 'false' depending on the value of the one or more parameters, such as a parameter Y.
0062The database table 814 may serve for storage of parameter values that may be required for evaluation of the condition 816, such as the parameter value for Y.
0063In operation the computer system 160 performs five processes as explained in detail with respect to <figref idref="f0010">Fig. 9</figref>.
0064The first process comprises the step 900 in which the program P1 is started for execution of a computational task in the following step 902. Upon completion of the execution of program P1 in step 904 a request is generated for setting the status X in order to indicate that the execution of the computational task has been completed. This request is sent from the program P1 to the state machine 806 which triggers the second process.
0065In step 906 of the second process the state machine performs a write access to the database table 810 in order to write the status preX rather than the status X into that database table. In step 908 the database access is performed by the state machine 806 in order to make an attempt for fetching a condition that is assigned to the task that has been executed in the first process. In step 910 a determination is made whether this database access did return a condition or not. If no condition is returned this indicates that no extension steps are required such that the status X is set in step 912 by performing a respective database write operation by the state machine 806. In the opposite case the timer 808 is started in step 914 and a database access for reading the parameter values that are required for evaluation of the condition that has been fetched in step 908 is performed in step 916, such as for reading the parameter value of Y. In step 918 the condition is evaluated using at least the value of Y that has been read in step 916. In step 920 a determination is made whether the evaluation of the condition has returned 'true'. If this is the case the condition is already fulfilled without requiring performance of extension steps, such that the timer is reset in step 922 and the control goes to step 912 for setting the status X.
0066If the condition returns 'false' the control goes from step 920 to step 924 where execution of the third process is invoked and from there back to step 916.
0067In the third process the extension steps are executed by performance of the program P3 which is started in step 926 and executed in step 928 whereby the value of Y and/or other parameters is modified. In step 930 a database access is performed to the database table 814 in order to write the modified value of Y. Hence, the repeated execution of the loop formed by steps 916, 918, 920 and 924 in the second process may be terminated if the evaluation of the condition in step 918 returns 'true' due to such a modification of the value of the parameter Y.
0068In order to prevent an endless loop a fourth process is invoked in step 914 by the starting of the timer 804. In the fourth process the timer value is read in step 932 and a determination is made in step 934 whether the timer value is above a predefined threshold value. If this is not the case the control goes back to step 932; otherwise a signal is generated in step 936 that indicates a time-out. This signal may be displayed on a computer monitor in order to inform an operator which may then take corrective action.
0069The fifth process is loosely coupled to the first process via the status X that may or may not be stored in the database table 810. In step 938 a read access to the database table 810 is performed in order to check in step 940 whether the status X has been set or not. If the status X has been set, the program P2 is started in step 942 for execution of a further computational task in step 944.
0070<figref idref="f0011">Fig. 10</figref> shows a data processing system that is constituted by multiple cascaded computer systems of the type of computer system 860 of the <figref idref="f0009">Fig. 8</figref> and <figref idref="f0010">9</figref> embodiments, such as computer i and computer j that are consecutive elements of the cascade. The computer i has a program Pi1 that corresponds to the computer program P1, computer program Pi2 that corresponds to P2 and computer program Pi3 that corresponds to computer program P3. The same applies analogously to the computer j and the other computers not shown in <figref idref="f0011">Fig. 10</figref> that constitute the data processing system. The computer program Pi1 and Pi2 as well as Pj1 and Pj2 and the corresponding computer programs of the other computers of the cascade have web services interfaces 812 and 814. The web services interface 814 of a preceding one of the computers of the cascade is coupled to the web services interface 812 of the consecutive computer system thereby forming the cascaded arrangement of the computers, as shown in <figref idref="f0011">Fig. 10</figref> with respect to the computers i and j.
0071Upon completion of the further computational task the program Pi2 sends a web services push message 816 with an input value to the next element of the cascade, i.e. the web services interface 812 of program Pj1 of the next element of the cascade which triggers execution of Pj1 (cf. step 900 of <figref idref="f0010">Fig. 9</figref>). Likewise execution of the further computational task by the program Pj2 results in sending another push message 818 to the following element of the cascade not shown in <figref idref="f0011">Fig. 10</figref>.
0072The nature of the computational tasks performed by the various computer programs of the computers that constitute the cascade may vary from computer to computer for implementation of a complex data processing operation involving multiple computational tasks. In one embodiment at least one element of the cascade implements extension steps for error checking and/or error correction such as by using an error correcting code.
0073A particular advantage of the data processing system of <figref idref="f0011">Fig. 10</figref> is that the cascaded arrangement of multiple computers avoids a single point of failure. If one of the computer systems becomes defective it can be replaced by an equivalent replacement computer system without necessarily interrupting overall operation of the data processing system as the push messages propagate through the cascade.
0074The disclosed invention may be summarized as follows: <ul id="ul0002" list-style="none"><li>Item 1. A computer implemented method comprising first, second, third, fourth and fifth processes, the first process comprising: <ul id="ul0003" list-style="dash" compact="compact"><li>executing a first program component for performing a computational task,</li><li>upon completion of the execution of the computational task, generating a -request to set a status indicating completion of the computational task by the first program component,</li><li>sending the request from the first program component to a state machine (806),</li></ul> the second process comprising: <ul id="ul0004" list-style="dash" compact="compact"><li>receiving the request from the first program component by the state machine,</li><li>in response to receipt of the request from the first program component performing a write database access for writing a precursor of the status into a database table (810) by the state machine,</li><li>performing a database query in order to fetch a condition being assigned to the computational task from a database table (814) by the state machine,</li><li>determining whether the database query did return the condition,</li><li>if the database query did return the condition, then performing: <ol id="ol0001" compact="compact" ol-style=""><li>a) starting a timer (804),</li><li>b) performing a database access for reading at least one parameter value from a database table (814),</li><li>c) evaluating the condition using the at least one parameter value,</li><li>d) determining whether the condition is true,</li><li>e) if the condition is true performing a write database access in order to write the status into the database table (810) and resetting the timer,</li><li>f) if the condition is not true, invoking the third process and going back to step b),</li></ol></li><li>if the database query did not return the condition, performing a write database access in order to write the status into the database table (810),</li></ul> the third process comprising: <ul id="ul0005" list-style="dash" compact="compact"><li>executing a third program component for performing an additional computational task, the additional computational task resulting in a modification of at least one of the parameters (y),</li><li>performing a write database access by the third program component for writing the at least one modified parameter value to the database table (814),</li></ul> the fourth process and comprising <ul id="ul0006" list-style="dash" compact="compact"><li>repetitively reading the timer value of the timer by a monitoring program component (802),</li><li>determining whether the timer value has reached or is above a predefined threshold value, and if so generating a signal being indicative of the fulfillment of a time-out condition to prevent an endless loop by the monitoring program component,</li></ul> the fifth process comprising: <ul id="ul0007" list-style="dash" compact="compact"><li>repetitively performing a read operation to the database table (810) for determining whether the status has been set,</li><li>if the status has been set executing a second program component for performing a further computational task.</li></ul></li><li>Item 2. The computer implemented method of claim 1 being executed consecutively multiple times by cascaded computers, the first program component of one computer (j) of the cascade being adapted to receive a web services push message (816) from the second program component of a computer (i) of the cascade preceding the one computer, and further comprising a step of starting the execution of the first program component for performing the computational task in response to receipt of the web services push message.</li><li>Item 3. The computer implemented method of Item 2, the additional computational task executed by the third program component comprising an error correction operation.</li><li>Item 4. The method of any one of Items 1 to 3 whereby the request comprises requesting a first update of a status field of an object, the computational task being executed in a first phase, and the precursor of the status indicating completion of the first phase, the further computational task being executed in a second phase, the method, comprising: <ul id="ul0008" list-style="none"><li>transmitting over a communications network a first update of a status field of an object to the database, the update indicating completion of a first phase of a first program component in a first computing system;</li><li>identifying, through a processing device, an object in the database having its status field indicate completion of the first phase;</li><li>performing a processing function at a second computing system on the identified object, the processing function varying depending on the object, the first and second computing systems communicatively independent of each other;</li><li>transmitting over the communications network a second update of the status field indicating completion of a second phase of the first program component to the database; and</li><li>initiating a second program component in the first computing system on an object in the database having its status field report completion of the second phase, the second program component communicatively independent of the first program component and the second computing system.</li></ul></li><li>Item 5. The method of any one of items 1 to 4, wherein the first phase represents a partial completion of the first program component.</li><li>Item 6. The method of any one of Items 1 to 5, wherein the second phase represents total completion of the first program component</li><li>Item 7. The method of any one of Items 1 to 6, wherein the processing function includes approving an activity performed during execution of the first program component.</li><li>Item 8. The method of any one of Items 1 to 7, the processing function further comprising: <ul id="ul0009" list-style="none"><li>determining, through user-supplied processing logic, whether further approval for the activity is necessary;</li><li>submitting an approval request for the activity to an entity according to the processing logic when approval is necessary, otherwise, updating the status field of the object to indicate no approval needed; and</li><li>after electronically receiving an answer to the approval request from he entity, updating the status field to reflect the answer.</li></ul></li><li>Item 9. The method of any one of Items 1 to 8, the processing function further comprising: <ul id="ul0010" list-style="none"><li>If the answer indicates that the approval request has been approved, determining, through user-supplied processing logic, whether additional approval is needed;</li><li>when additional approval is needed, iteratively submitting additional approval requests to entities in a hierarchical order after receiving approvals from subordinate entities;</li><li>updating the status field to reflect rejection after receiving a first rejection; and otherwise updating the status field to reflect approval after receiving approvals from each entity in the hierarchy.</li></ul></li><li>Item 10. The method of Item 8 or 9, wherein the user-supplied processing logic includes use of a lookup table.</li><li>Item 11. The method of any one of Items 7 to 10, the processing function further comprising: <ul id="ul0011" list-style="none"><li>extracting data relating to the activity;</li><li>restructuring the data into a format compatible with a third party computing system;</li><li>sending the extracted data to the third party computing system to obtain a result of further processing of the extracted data; and</li><li>after receiving the result from the third part computing system, storing the result in another computing system.</li></ul></li><li>Item 12. The method of Item 11, further comprising transmitting a status update dependent on the result to the database.</li><li>Item 13. The method of any one of Items 1 to 12, wherein the first and the second computing systems are connected to a same network.</li><li>Item 14. The method any one of Items 1 to 13, wherein the first computing system is a core system and the second computing system is an action management system.</li></ul>
11 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11
Every citation, both ways
| Reference | Relation |
|---|---|
| Loesgen B: "A Messaging-based State Machine Design Pattern, using BizTalk Server", Internet citation, 27 October 2005 (2005-10-27), pages 1-3, XP002666195, Retrieved from the Internet: URL:http://www.brianloesgen.com/blog/2005/ 10/27/a-messaging-based-state-machine-desi gn-pattern-using-biztalk.html?printerFrien dly=true [retrieved on 2011-12-20] | Non-patent |
6 members in 2 offices
Priority claims4
| Document | Office | Kind | Date |
|---|---|---|---|
| 84714210 | United States of America | A | |
| 847142 | United States of America | – | |
| US20100847142 | – | – | – |
| 847142 | – | – | – |
Members6
| Document | Office | Kind | |
|---|---|---|---|
| US2012030223A1 | United States of America | A1 | |
| EP2416246A1 | European Patent Office (EPO) | A1 | |
| US2013024472A1 | United States of America | A1 | |
| US8862613B2 | United States of America | B2 | |
| EP2416246B1This record | European Patent Office (EPO) | B1 | |
| US9697042B2 | United States of America | B2 |
71 legal events, as 9 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Fee paymentPLFP | PLFP | FR | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Fee paymentPLFP | PLFP | FR | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Fee paymentPLFP | PLFP | FR | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filedOpposition26N | 26N | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent lapsedLapsedMM4A | MM4A | IE | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent ceasedCeasedPL | PL | CH | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Invalidated european patentMG4D | MG4D | LT | |
| Patent invalid in the netherlands as no translation has been filedMP | MP | NL | |
| Deletion acc. to par. 5 (withdrawal of the translation of the ep patent)MK05 | MK05 | AT | |
| Dpma publication of mentioned ep patent grantGrantedR096 | R096 | DE | |
| Reference to at number (ep patent validated in austria)REF | REF | AT | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| Designated contracting statesAK | AK | EP | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Intention to grant announcedINTG | INTG | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Amendment of ipc main classPREVIOUS MAIN CLASS: G06F0009540000R079 | R079 | DE | |
| Party data changed (applicant data changed or rights of an application transferred)RAP1 | RAP1 | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 2416246
- Publication, DOCDB
- 2416246
- Publication, EPODOC
- EP2416246
- Application
- 11174778
- Application, DOCDB
- 11174778
- Application, EPODOC
- EP20110174778
Titles3
- German
- Erweiterbarkeit eines Geschäftsprozesses und Anwendungslogik
- English
- Extensibility of business process and application logic
- French
- Extensibilité de procédé commercial et logique d'application
Classification
- CPC, 3
- G06F9/4843
- G06F9/52
- G06F16/2358
- IPC, 2
- G06F9 48
- G06F9 52
Designated states38
- Contracting states, 38
- Albania
- Austria
- Belgium
- Bulgaria
- Switzerland
- Cyprus
- Czechia
- Germany
- Denmark
- Estonia
- Spain
- Finland
- France
- United Kingdom
- Greece
- Croatia
- Hungary
- Ireland
- Iceland
- Italy
- Liechtenstein
- Lithuania
- Luxembourg
- Latvia
and 14 moreShow fewer
- Monaco
- North Macedonia
- Malta
- Netherlands (Kingdom of the)
- Norway
- Poland
- Portugal
- Romania
- Serbia
- Sweden
- Slovenia
- Slovakia
- San Marino
- Türkiye
