Sap Se

Sap Ag

Matthias Miltz

Sören Balko

Boris Klinker

Franz Weber

Soeren Balko

Thilo-Alexander Ginkel

Andreas Buchen

Methods and apparatus, including computer program products, are provided for transporting processes within a distributed computing system, such as a cluster. In one aspect, the computer-implemented method may receive an event at a first node. The event may correspond to a process instance for handling the received event. The process instance may be transported from a second node to the first node. The process instance may be transported from a persistence when the process instance is inactive and, when the process instance is active, the process instance may be persisted to enable transport to the first node. Related apparatus, systems, methods, and articles are also described.

Cluster-based business process management through eager displacement and on-demand recovery

The subject matter disclosed herein provides methods and apparatus, including computer program products for rules-based processing. In one aspect there is provided a method. The method may include, for example, evaluating rules to determine whether to enable or disable one or more actions in a ready set of actions. Moreover, the method may include scheduling the ready set of actions, each of which is scheduled for execution and executed, the execution of each of the ready set of actions using a separate, concurrent thread, the concurrency of the actions controlled using a control mechanism. Related systems, apparatus, methods, and/or articles are also described.

Multithreading and concurrency control for a rule-based transaction engine

According to some embodiments, it may be detected that a deployment archive to be deployed to a runtime server includes first and second business process artifacts, wherein the first artifact supports versioning and the second artifact does not support versioning. A version identifier to be associated with the second artifact may then be calculated, and at least one prior version identifier of the second artifact, associated with at least one prior deployment of the deployment archive to the runtime server, may be determined based on information from a version history database. The deployment archive containing the first and second artifacts may then be deployed to the runtime server along with the prior versions of the second artifact associated with the determined prior version identifiers. A new version history may then be stored in the version history database by adding the newly calculated version identifier to the at least one determined prior version identifier.

Deployment mechanism for non-versioning business process artifacts

The subject matter disclosed herein provides methods and apparatus, including computer program products, for state alignment and transaction coupling to enable reliable communication between an application, such as a backend system, and a correlation engine (or rules engine). In one aspect there is provided a method. The method may provide a first interface to receive information from an adapter for an application separate from a state correlation engine and provide a second interface to receive information from the state correlation engine to the adapter. The first and second interfaces may provide state alignment between the application and the state correlation engine. Related systems, apparatus, methods, and/or articles are also described.

Transaction aware, flexible interface for a state correlation and transition execution engine

Methods and apparatus, including computer program products, are provided for distributed process execution. In one aspect, the computer-implemented method may provide an indication announcing that a structural change to the cluster will occur. The indication may enable at least one node of the cluster to respond with an existing view. The existing view may include a first set of authoritative data representing existing processes handled at the at least one node. The method may also include providing, to at least one of the nodes, an index representing a subsequent view of the cluster after the structural change. The subsequent view may include a second set of authoritative data representing processes handled at the at least one node after the structural change. The method may also activate the subsequent view of the cluster. Related apparatus, systems, methods, and articles are also described.

Failover mechanism for distributed process execution

Methods and apparatus, including computer program products, for compiling workflows into instructions for a state correlation engine. In general, data characterizing a workflow of a process is received and a network representation of event-condition-action rules representing the workflow is generated. The workflow of the process may be modeled in accordance with a notation similar to the Business Process Modeling Notation. The network representation of event-condition-action rules may include a combination of source nodes representing events, operator nodes representing conditions, and action nodes representing transactions. Events of the source nodes may be represented types of objects of a type language, where a correlation engine is to execute an event-condition-action rule based on an existence of a combination of types of a rule.

Compiling workflows into instructions for a state correlation engine

Methods and apparatus, including computer program products, related to stateful, continuous evaluation of event-condition-action rules by a state correlation engine. In general, one or more events may be determined to have occurred and an event-condition-action cycle may be caused to be processed for the events. The event-condition-action cycle may include evaluating condition networks based on a state of execution of the state correlation engine that includes the events, where the state of execution is based on a state of execution before the events, and enabling the actions to be executed if evaluation of the condition networks with the state of execution is to result in one or more actions being enabled.

Stateful, continuous evaluation of rules by a state correlation engine

The subject matter disclosed herein provides methods and apparatus, including computer program products for handing transactions. The method may include, for example, processing, at a state correlation engine, a plurality of transactions; saving the effects of at least one of the transactions to a persistence, when the at least one transaction includes a reliable interaction with an external application; saving other transactions to a buffer rather than to the persistence; and reading the at least one transaction from the persistence and continuously executing rules representing the other transactions in response to a failure causing a recovery. Related systems, apparatus, methods, and/or articles are also described.

Transient transaction execution with on-demand persistency

Methods and apparatus, including computer program products, for mapping deep structured data structures. Statements defining a mapping of source elements formatted in accordance with a first hierarchical structure to a target formatted in accordance with a second hierarchical structure are received. The first and second hierarchical structures may be different. A mapping of the source elements to the target in accordance with the statements may be performed, where the statement may be defined in accordance with a mapping language. The mapping language may define that a single statement may represent an iterative approach to mapping elements from the source to the target. The mapping language may support selection of source elements using a format that allows for navigation through a hierarchy of the source. The mapping language may also support nested statements which may allow for nested iterations in which to perform mappings.

Growing community of inventors

Heidelberg, Germany

Matthias Miltz