Abstract: An orchestration engine may execute multiple, concurrently running instances of a process model, where each of the instances of the process model includes one or more receiving objects. A messaging endpoint may be shared by the instances of the process model and may be configured to receive messages. A subscription handler may handle multiple subscriptions for the instances and may be configured to define a first subscription for a first instance of the multiple instances, where the first subscription includes a correlation expression, an association with the messaging endpoint, and an association with a first receiving object within the first instance. The subscription handler also may associate the first subscription with the first instance and initialize the first subscription associated with the first instance. A routing manager may route received messages that match the first subscription to the first receiving object.

Abstract: A search query to provide a search result may be received, which identifies source and target nodes and an application for generating the search result. The application accesses a data structure holding landmark nodes, which store a shortest path tree in the form of a set of parent links. Each parent link can identify an adjacent vertex node in a shortest path between each node in the data structure and the landmark node. The location of the source node and the target node in the shortest path trees may be identified to the landmark node. For each landmark node, using the identified locations of the target node and source node, a measure of distance between the source node and the target may be generated. The landmark node with the shortest distance may be determined. A search result related to the shortest path tree of that landmark node may be provided.

Abstract: According to an embodiment, there is provided a method of generating a data structure stored in computer memory for processing a search query in a network of interconnected nodes, wherein the method comprises selecting landmark nodes by the following steps and storing the selected landmark nodes in the data structure: sampling from the network nodes a first sample of vertex pairs, computing the shortest path for each vertex pair, each shortest path comprising a set of vertices between each vertex in the vertex pair; identifying a first landmark node which occurs in more of the shortest paths more often than any other vertex; removing from the network vertices shortest paths including the first landmark node and identifying a second landmark node which occurs in more of the remaining shortest paths than any other remaining vertex.

Abstract: A search query to provide a search result may be received, which identifies source and target nodes and an application for generating the search result. The application accesses a data structure holding landmark nodes, which store a shortest path tree in the form of a set of parent links. Each parent link can identify an adjacent vertex node in a shortest path between each node in the data structure and the landmark node. The location of the source node and the target node in the shortest path trees may be identified to the landmark node. For each landmark node, using the identified locations of the target node and source node, a measure of distance between the source node and the target may be generated. The landmark node with the shortest distance may be determined. A search result related to the shortest path tree of that landmark node may be provided.

Abstract: According to an embodiment, there is provided a method of generating a data structure stored in computer memory for processing a search query in a network of interconnected nodes, wherein the method comprises selecting landmark nodes by the following steps and storing the selected landmark nodes in the data structure: sampling from the network nodes a first sample of vertex pairs, computing the shortest path for each vertex pair, each shortest path comprising a set of vertices between each vertex in the vertex pair; identifying a first landmark node which occurs in more of the shortest paths more often than any other vertex; removing from the network vertices shortest paths including the first landmark node and identifying a second landmark node which occurs in more of the remaining shortest paths than any other remaining vertex.

Abstract: A system may include a thread monitor that is arranged and configured to monitor progress of multiple threads of a workflow process at a synchronization point with each of the threads having a state, and configured to generate at least one inspection trigger for inspection of the threads. A thread inspector may inspect the threads at the synchronization point for a change in the state in any of the threads in response to the inspection trigger. A firing rules engine may determine whether or not the synchronization point should fire based at least in part on the change in the state of at least one of the threads.

Abstract: A system may include a gateway that is configured to intercept messages being exchanged between multiple services, a message repository that is logically coupled to the gateway and that is configured to store the intercepted messages, a service description repository that is configured to store multiple service descriptions, where each of the service descriptions corresponds to one of the services, a rules repository that is configured to store mapping rules and an adaptation engine that is configured to generate a sequence of firing rules using the service descriptions and the mapping rules responsive to the intercepted messages, to generate one or more outgoing messages in response to the intercepted messages using the sequence of firing rules, and to detect at runtime an occurrence of a termination anomaly.

Abstract: A process model specified using, for example, UML activity diagrams can be translated into an event-based model that can be executed on top of a coordination middleware. For example, a process model may be encoded as a collection of coordinating objects that interact with each other through a coordination middleware including a shared memory space. This approach is suitable for undertaking post-deployment adaptation of process-oriented composite applications. In particular, new control dependencies can be encoded by dropping new (or enabling existing) coordinating objects into the space and/or disabling existing ones.

Abstract: In one embodiment, the present invention includes a computer-implemented method of adapting software component interfaces by providing a user interface for specifying a provided interface, a required interface and interface operators. In another embodiment the present invention includes a computer-implemented method of adapting interfaces comprising receiving an adapter specification, receiving a plurality of communication actions from a first software component, transforming one or more of the communication actions in accordance with predefined interface operations; and sending transformed communication actions to a second software component.

Abstract: A process model specified using, for example, UML activity diagrams can be translated into an event-based model that can be executed on top of a coordination middleware. For example, a process model may be encoded as a collection of coordinating objects that interact with each other through a coordination middleware including a shared memory space. This approach is suitable for undertaking post-deployment adaptation of process-oriented composite applications. In particular, new control dependencies can be encoded by dropping new (or enabling existing) coordinating objects into the space and/or disabling existing ones.

Abstract: A process model specified using, for example, UML activity diagrams can be translated into an event-based model that can be executed on top of a coordination middleware. For example, a process model may be encoded as a collection of coordinating objects that interact with each other through a coordination middleware including a shared memory space. This approach is suitable for undertaking post-deployment adaptation of process-oriented composite applications. In particular, new control dependencies can be encoded by dropping new (or enabling existing) coordinating objects into the space and/or disabling existing ones.

Abstract: A system may include a gateway that is configured to intercept messages being exchanged between multiple services, a message repository that is logically coupled to the gateway and that is configured to store the intercepted messages, a service description repository that is configured to store multiple service descriptions, where each of the service descriptions corresponds to one of the services, a rules repository that is configured to store mapping rules and an adaptation engine that is configured to generate a sequence of firing rules using the service descriptions and the mapping rules responsive to the intercepted messages, to generate one or more outgoing messages in response to the intercepted messages using the sequence of firing rules, and to detect at runtime an occurrence of a termination anomaly.

Abstract: An orchestration engine may execute multiple, concurrently running instances of a process model, where each of the instances of the process model includes one or more receiving objects. A messaging endpoint may be shared by the instances of the process model and may be configured to receive messages. A subscription handler may handle multiple subscriptions for the instances and may be configured to define a first subscription for a first instance of the multiple instances, where the first subscription includes a correlation expression, an association with the messaging endpoint, and an association with a first receiving object within the first instance. The subscription handler also may associate the first subscription with the first instance and initialize the first subscription associated with the first instance. A routing manager may route received messages that match the first subscription to the first receiving object.

Abstract: A system may include a thread monitor that is arranged and configured to monitor progress of multiple threads of a workflow process at a synchronization point with each of the threads having a state, and configured to generate at least one inspection trigger for inspection of the threads. A thread inspector may inspect the threads at the synchronization point for a change in the state in any of the threads in response to the inspection trigger. A firing rules engine may determine whether or not the synchronization point should fire based at least in part on the change in the state of at least one of the threads.

Abstract: In one embodiment, the present invention includes a computer-implemented method of adapting software component interfaces by providing a user interface for specifying a provided interface, a required interface and interface operators. In another embodiment the present invention includes a computer-implemented method of adapting interfaces comprising receiving an adapter specification, receiving a plurality of communication actions from a first software component, transforming one or more of the communication actions in accordance with predefined interface operations; and sending transformed communication actions to a second software component.