| Patent application number | Description | Published |
|---|
| 20080240153 | TESTING PROTOCOL COMPATABILITY - Embodiments of the present invention address deficiencies of the art in respect to conversation protocol validation and provide a method, system and computer program product for testing protocol compatibility between trading partners in a B2B conversation. In one embodiment of the invention, a method for testing protocol compatibility between roles in a B2B conversation can be provided. The method can include selecting at least two roles from amongst global process models, constructing local protocols for each of the selected roles, generating a conversation protocol from the constructed local protocols, and detecting dead-end states in the generated conversation protocol to identify protocol incompatibility while identifying protocol compatibility in the absence of dead-end states in the generated conversation protocol. | 10-02-2008 |
| 20080263093 | GENERATION OF A SET OF PRE-FILTERS FROM A SET OF EVENT SUBSCRIPTIONS TO MORE EFFICIENTLY SELECT EVENTS OF INTEREST - A method, system and computer program product for achieving a balance between pre-filter efficiency and pre-filter throughput. Event subscriptions are obtained for a given event consumer. The event subscriptions define the events to be routed to this event consumer. Pre-filters of varying complexity and filtering power are constructed based on these event subscriptions. A balance between pre-filter efficiency and pre-filter throughput may be achieved by selecting the best pre-filter out of these constructed pre-filters to filter events to its associated event consumer. The best pre-filter is selected by comparing a complexity threshold (e.g., a limit for the number of atomic Boolean expressions in a pre-filter) with the actual complexity (e.g., the actual number of atomic Boolean expressions) for each constructed pre-filter and selecting the most complex pre-filter without exceeding the threshold. | 10-23-2008 |
| 20090031305 | Modeling Homogeneous Parallelism - A model of a process is created using novel “fan-out” and “fan-in” symbols. A fan-out symbol represents a point in the process flow where a variable number of homogeneous parallel outgoing threads are being split out from a single incoming thread. The fan-in symbol represents a point in the process flow where a variable number of parallel incoming threads with homogeneous output are combined into one or more outgoing threads. | 01-29-2009 |
| 20090199204 | SYSTEMS AND METHODS FOR CONSTRUCTING PROTOCOL STATE MACHINES TO DETERMINE THE VALIDITY OF AN IMPLEMENTATION OF A SERVICE INTERFACE - A system is provided for constructing an implementation protocol given (a) a partner interaction protocol describing possible sequences of messages between two interacting parties, (b) one or more protocols of message exchange patterns of operations of a service interface, and (c) an implementation mapping that maps the input and output messages of the service interface to messages between the two interacting parties. The system includes at least one processor, and an implementation-protocol generating module that executes on the at least one processor. The implementation-protocol generating module is configured to generate a state-machine graph representing the partner interaction protocol, to generate at least one state-machine graph representing message exchange patterns corresponding to operations of the service interface, and to construct from the state-machine graphs an implementation protocol that defines which operations of the service interface are used for any sequence of message flows of the process role. | 08-06-2009 |
| 20090222789 | Compiler for a Declarative Event-Driven Programming Model - A compiler generates code providing an execution sequence, from a declarative event-driven model, for execution by a computer. To assist in debugging the declarative event-driven model, the compiler also generates cross-references that relate steps in the generated code to elements of the declarative source code. The cross-references may be used as input to a debugger, along with the declarative source and the generated code, to assist a user who is stepping through the generated code (for example) in understanding which portion of the declarative source gave rise to the current step in the generated execution sequence. | 09-03-2009 |
| 20090222793 | Virtual Machine and Programming Language for Event Processing - A virtual machine supports execution of compiler-generated code and provides an execution environment for code that may correspond to any of several different event-driven or message-driven programming models (such as state machines, rules for complex event processing and event correlation, monitoring contexts, processes, and mediations). The programming models may be used in business monitoring and/or business integration environments. A programming language is defined for execution using the virtual machine, which contains a relatively small number of instructions and which is preferably generated by a compiler from a higher-level, event-driven or message-driven model. | 09-03-2009 |
| 20090222795 | Debugger for a Declarative Event-Driven Programming Model - A compiler generates code providing an execution sequence, from a declarative event-driven model, for execution by a computer. To assist in debugging the declarative event-driven model, the compiler also generates cross-references that relate steps in the generated code to elements of the declarative source code. The cross-references may be used as input to a debugger, along with the declarative source and the generated code, to assist a user who is stepping through the generated code (for example) in understanding which portion of the declarative source gave rise to the current step in the generated execution sequence. | 09-03-2009 |
