← Back to Patent Explorer
US6009405A Expired / Lapsed US ⏱️ 0.0 years remaining

Ensuring atomicity for a collection of transactional work items in a workflow management system

Assignee: International Business Machines Corp
•
Filing: 1997-07-29
•
Granted: 1999-12-28
•
Expires: 2017-07-29
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A computerized transaction execution with a workflow management systems (WFMS) executes a process model consisting of a network of potentially distributed activities including transactional work items. A computerized methodology defines, controls and processes a collection of a transactional work items ensuring the atomicity of the collection of transactional work items. The collection of transactional work items owns a separate commit scope not influenced by a commit scope potentially implemented within said transactional work items. The WFMS is enabled to infer details of the process model of collections of transactional work items which can be processed in the sense of global transactions with a common commit scope. Transactional work items with a common commit scope are combined into atomic spheres. The collection of transactional work items constitute a common atomic sphere in an alternative embodiment.

Inventors

  • 👤 Frank Leymann
  • 👤 Dieter Roller

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 21:10
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/10; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/466; G06Q10/06; G06Q10/063; G06Q10/0633; G06Q10/103

Claims Analysis

Total Claims: 21
Claim 1
Independent Claim 200 words
A computer-based method of defining and executing at least one atomic-sphere, said atomic sphere comprising a collection of transactional-work items with a common commit scope representing a global transaction, in order to ensure atomicity of a collection of transactional-work items by at least one computer system, said computer system storing a process-model, said process-model comprising one or more activities being represented as nodes of an arbitrary flow graph, and directed edges of said graph being control-connectors defining a potential flow of control between nodes within said process-model and one or more of said activities being transactional-work items which change resources and data of said computer system, said method of defining and executing comprising: defining said atomic-sphere as a subgraph of said process-model said subgraph containing a subset of said activities and potential flow of control which provides a recoverable consistent state of the process, further determining portions of said potential flow of control of said subgraph which contain at least one activity outside the boundary of said atomic sphere, and wherein during execution said at least one activity outside said boundary of said atomic sphere are processed after the flow of control within said boundary of said atomic-sphere is completed.
Claim 2
Dependent Claim 200 words
A computer-based method of defining and executing at least one atomic-sphere, said atomic sphere comprising a collection of transactional-work items with a common commit scope representing a global transaction, in order to ensure atomicity of a collection of transactional-work items by at least one computer system, said computer system storing a process-model, said process-model comprising one or more activities being represented as nodes of an arbitrary flow graph, and directed edges of said graph being control-connectors defining a potential flow of control between nodes within said process-model and one or more of said activities being transactional-work items which change resources and data of said computer system, said method of defining and executing comprising: defining said atomic-sphere as a subgraph of said process-model said subgraph containing a subset of said activities and potential flow of control which provides a recoverable consistent state of the process, further determining portions of said potential flow of control of said subgraph which contain at least one activity outside the boundary of said atomic sphere, and wherein during execution said at least one activity outside said boundary of said atomic sphere are processed after the flow of control within said boundary of said atomic-sphere is completed.
Claim 3
Dependent Claim 59 words
A computer-based method of defining at least one atomic-sphere as per claim 1, further comprising: determining sink-activities of said atomic-sphere with no outgoing control-connector, and if at least one sink-activity is determined, adding a no-op-activity to said process-model being outside of said atomic-sphere and connecting said sink-activity to that no-op-activity with a virtual-control-connector, said no-op-activity implementing a dummy activity.
Claim 4
Dependent Claim 33 words
A computer-based method of defining at least one atomic-sphere as per claim 2, wherein said control-connectors are associated with transition-conditions said method further comprising adding a TRUE-transition-condition always being true to said virtual-connectors.
Claim 5
Dependent Claim 25 words
A computer-based method of defining at least one atomic-sphere as per claim 1, further comprising being executed by a control-instance controlling execution of said process-model.
Claim 6
Dependent Claim 24 words
A computer-based method of defining at least one atomic-sphere as per claim 4, wherein said control-instance is one of a workflow-management-system or a transaction-processing-system.
Claim 7
Dependent Claim 69 words
A computer-based method of atomically executing an atomic-sphere as per claim 1, further comprising the steps of: creating an atomic-sphere-transaction-context for said atomic-sphere, if the control-flow along said control-connectors enters said atomic-sphere the first time, and ensuring that the control-flow will not leave said atomic-sphere until the complete control-flow reaches the boundary of said atomic-sphere by postponing navigation along control-connectors leaving said atomic-sphere until all leaving control-connectors are evaluated.
Claim 8
Dependent Claim 38 words
A computer-based method of atomically executing an atomic-sphere as per claim 6, further comprising ending said atomic-sphere-transaction-context, when the complete control-flow reaches said boundary of said atomic-sphere by committing all transactional-work items processed as part of said atomic-sphere.
Claim 9
Dependent Claim 39 words
A computer-based method of atomically executing an atomic-sphere as per claim 6 further comprising using an existing atomic-sphere-transaction-context, if the control-flow enters an atomic-sphere for which an atomic-sphere-transaction-context has been established already because the control-flow entered said atomic-sphere before.
Claim 10
Dependent Claim 52 words
A computer-based method of atomically executing an atomic-sphere as per claim 6, further comprising: wherein said transactional-work items may either never committing said ending said atomic-sphere-transaction-context of said atomic-sphere, or wherein said transactional-work items may committing said ending of said atomic-sphere-transaction-context of said atomic-sphere only, if no atomic-sphere-transaction-context has been established yet.
Claim 11
Dependent Claim 67 words
A computer-based method of atomically executing an atomic-sphere as per claim 6, further comprising one or more of the following steps: determining a potential existence of an atomic-sphere-transaction-context by an activity by either calling a query-transaction-service (GetRoot); passing said potential existing atomic-sphere-transaction-context to an activity when invoking said activity; or passing a transaction-identifier to an activity when invoking said activity said transaction-identifier allowing to determine said atomic-sphere-transaction-context.
Claim 12
Dependent Claim 42 words
A computer-based method of atomically executing an atomic-sphere as per claim 10, further encompassing at least one input-container associated with said activity and further comprising the step of passing said atomic-sphere-transaction-context to an activity within said atomic-sphere as part of said input-container.
Claim 13
Dependent Claim 90 words
A computer-based method of atomically executing an atomic-sphere as per claim 6, further comprising: ensuring that the control-flow will not leave said atomic-sphere (S) until the complete control-flow reaches the boundary of said atomic-sphere by administrating a set of actual-obstructions (OBST(S)) comprising the set of all control-connectors originating from activities within said atomic-sphere directed to target-activities outside said atomic-sphere and which control-connectors have not been reached so far by the current process instance; and delaying execution of said target-activities until all obstructions of said set of actual-obstructions have been reached.
Claim 14
Dependent Claim 24 words
A computer-based method of atomically executing an atomic-sphere as per claim 6, further comprising being executed by a control-instance controlling execution of said process-model.
Claim 15
Dependent Claim 27 words
A computer-based method of atomically executing an atomic-sphere as per claim 13, wherein said control-instance is one of a work-flow-management-system or wherein said control-instance is a transaction-processing-system.
Claim 16
Dependent Claim 212 words
An article of manufacture comprising a computer user medium having computer readable program code embodied therein for defining and executing at least one atomic-sphere, said atomic sphere comprising a collection of transactional-work items with a common commit scope representing a global transaction, in order to ensure atomicity of a collection of transactional-work items by at least one computer system, said computer system storing a process-model, said process-model comprising one or more activities being represented as nodes of an arbitrary flow graph, and directed edges of said graph being control-connectors defining a potential flow of control between nodes within said process-model and one or more of said activities being transactional-work items which change resources and data of said computer system, said method of defining and executing comprising: defining said atomic-sphere as a subgraph of said process-model said subgraph containing a subset of said activities and potential flow of control which provides a recoverable consistent state of the process, further determining portions of said potential flow of control of said subgraph which contain at least one activity outside boundary of said atomic sphere, and wherein during execution said at least one activity outside said boundary of said atomic sphere are processed after the flow of control within said boundary of said atomic-sphere is completed.
Claim 17
Dependent Claim 212 words
An article of manufacture comprising a computer user medium having computer readable program code embodied therein for defining and executing at least one atomic-sphere, said atomic sphere comprising a collection of transactional-work items with a common commit scope representing a global transaction, in order to ensure atomicity of a collection of transactional-work items by at least one computer system, said computer system storing a process-model, said process-model comprising one or more activities being represented as nodes of an arbitrary flow graph, and directed edges of said graph being control-connectors defining a potential flow of control between nodes within said process-model and one or more of said activities being transactional-work items which change resources and data of said computer system, said method of defining and executing comprising: defining said atomic-sphere as a subgraph of said process-model said subgraph containing a subset of said activities and potential flow of control which provides a recoverable consistent state of the process, further determining portions of said potential flow of control of said subgraph which contain at least one activity outside boundary of said atomic sphere, and wherein during execution said at least one activity outside said boundary of said atomic sphere are processed after the flow of control within said boundary of said atomic-sphere is completed.
Claim 18
Dependent Claim 71 words
An article of manufacture comprising a computer user medium having computer readable program code embodied therein defining at least one atomic-sphere as per claim 15, further comprising: determining sink-activities of said atomic-sphere with no outgoing control-connector, and if at least one sink-activity is determined, adding a no-op-activity to said process-model being outside of said atomic-sphere and connecting said sink-activity to that no-op-activity with a virtual-control-connector, said no-op-activity implementing a dummy activity.
Claim 19
Dependent Claim 200 words
A computer program product defining and executing at least one atomic-sphere, said atomic sphere comprising a collection of transactional-work items with a common commit scope representing a global transaction, in order to ensure atomicity of a collection of transactional-work items by at least one computer system, said computer system storing a process-model, said process-model comprising one or more activities being represented as nodes of an arbitrary flow graph, and directed edges of said graph being control-connectors defining a potential flow of control between nodes within said process-model and one or more of said activities being transactional-work items which change resources and data of said computer system, said method of defining and executing comprising: defining said atomic-sphere as a subgraph of said process-model said subgraph containing a subset of said activities and potential flow of control which provides a recoverable consistent state of the process, further determining portions of said potential flow of control of said subgraph which contain at least one activity outside said boundary of said atomic sphere, and wherein during execution said at least one activity outside the boundary of said atomic sphere are processed after the flow of control within said boundary of said atomic-sphere is completed.
Claim 20
Dependent Claim 200 words
A computer program product defining and executing at least one atomic-sphere, said atomic sphere comprising a collection of transactional-work items with a common commit scope representing a global transaction, in order to ensure atomicity of a collection of transactional-work items by at least one computer system, said computer system storing a process-model, said process-model comprising one or more activities being represented as nodes of an arbitrary flow graph, and directed edges of said graph being control-connectors defining a potential flow of control between nodes within said process-model and one or more of said activities being transactional-work items which change resources and data of said computer system, said method of defining and executing comprising: defining said atomic-sphere as a subgraph of said process-model said subgraph containing a subset of said activities and potential flow of control which provides a recoverable consistent state of the process, further determining portions of said potential flow of control of said subgraph which contain at least one activity outside said boundary of said atomic sphere, and wherein during execution said at least one activity outside the boundary of said atomic sphere are processed after the flow of control within said boundary of said atomic-sphere is completed.
Claim 21
Dependent Claim 59 words
A computer program product defining at least one atomic-sphere as per claim 17, further comprising: determining sink-activities of said atomic-sphere with no outgoing control-connector, and if at least one sink-activity is determined, adding a no-op-activity to said process-model being outside of said atomic-sphere and connecting said sink-activity to that no-op-activity with a virtual-control-connector, said no-op-activity implementing a dummy activity.

References Cited (Backward Citations)

US4803039A Cited
US4815014A Cited
US4858147A Cited
US5617510A Cited
US5557515A Cited
US5301320A Cited
GB2263988A Cited
WO1994018620A1 Cited
WO1995003345A1 Cited
EP0694838A1 Cited
US5826239A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-12-27 2003-06-28 2003-12-28 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-12-27 2007-06-28 2007-12-28 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-12-27 2011-06-28 2011-12-28 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag