| Patent application number | Description | Published |
|---|
| 20090112887 | MAPPING DEEP STRUCTURED DATA STRUCTURES - 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. | 04-30-2009 |
| 20090113380 | Integrated Model Checking and Issue Resolution Framework - A plurality of constraints are identified for a model of a software deployment in an integrated development environment. Each of the constraints are associated with one of a plurality of analysis levels. It is determined for each analysis level whether the corresponding associated constraints are met so that an identification indicating the same may be provided. Related techniques, apparatus, systems, and articles are described. | 04-30-2009 |
| 20090164548 | Message transport manager and methods for using the same - Methods and systems consistent with the invention manage messages transported between a first computer system and a second computer system. For instance, in one embodiment, According to another exemplary embodiment, a method obtains a business object identifier that identifies a business object associated with a first message to be transported over a network from the first computer system to the second computer system. The method may then generate a transport identifier associated with the transported message. The method may then route the first message the second computer system, such that the routing generates a second message that is transported to the second computer system. The method then obtains the second message transported to the second computer system. Finally, the method creates a data structure in memory including the transport identifier, the business object identifier, and the second message. | 06-25-2009 |
| 20090164985 | COMPILING WORKFLOWS INTO INSTRUCTIONS FOR A STATE CORRELATION ENGINE - 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. | 06-25-2009 |
| 20090327199 | STATEFUL, CONTINUOUS EVALUATION OF RULES BY 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. | 12-31-2009 |
| 20100023339 | BUSINESS EVENT AGENTS - A system may include reception of a core event associated with a business object, evaluation of one or more rules based on the core event to identify a business event, construction of a message based on a mapping between the business object and an event interface, the mapping and the event interface associated with the business event and the business object; and publication of the message. | 01-28-2010 |
| 20100153778 | Transient Transaction Execution With On-Demand Persistency - 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. | 06-17-2010 |
