Abstract: A method, and associated computer program product and computer system. A Direct Acyclic Graph (DAG) includes nodes and directed edges. Each node represents a unique resource and is a predefined Recovery Time Objective (RTO) node or an undefined RTO node. Each directed edge directly connects two nodes and represents a time delay between the two nodes. The nodes are topologically sorted to order the nodes in a dependency sequence of ordered nodes. A corrected RTO is computed for each ordered node.

Abstract: A method, and associated computer program product and computer system. A Direct Acyclic Graph (DAG) includes nodes and directed edges. Each node represents a unique resource and is a predefined Recovery Time Objective (RTO) node or an undefined RTO node. Each directed edge directly connects two nodes and represents a time delay between the two nodes. The nodes are topologically sorted to order the nodes in a dependency sequence of ordered nodes. A corrected RTO is computed for each ordered node.

Abstract: A method, computer program product, and computer system for generating a timing sequence for activating resources linked through time dependency relationships. A Direct Acyclic Graph (DAG) includes nodes and directed edges. Each node represents a unique resource and is a predefined Recovery Time Objective (RTO) node or an undefined RTO node. Each directed edge directly connects two nodes and represents a time delay between the two nodes. The nodes are topologically sorted to order the nodes in a dependency sequence of ordered nodes. A corrected RTO is computed for each ordered node after which an estimated RTO is calculated as a calculated RTO for each remaining undefined RTO node. The ordered nodes in the dependency sequence are reordered according to an ascending order of the corrected RTO of the ordered nodes to form a timing sequence for activating the unique resources represented by the multiple nodes.

Abstract: An approach for managing services in a cloud computing service marketplace. In the approach, a request for a service offered within a cloud computing service marketplace is received. A processor validates the request to confirm the service is offered within the cloud computing service marketplace. A processor applies a marker for the request, wherein the marker enables the request to be tracked. A processor validates the request to confirm that a sender of the request corresponds to a user account. A processor selects a handler from a set of one or more handlers to execute the request based on the request for the service and the service being offered by the cloud computing service marketplace, wherein the handler is capable of executing a business logic technique. A processor executes the business logic technique for the request using the handler.

Abstract: A method, computer program product, and computer system for generating a timing sequence for activating resources linked through time dependency relationships. A Direct Acyclic Graph (DAG) includes nodes and directed edges. Each node represents a unique resource and is a predefined Recovery Time Objective (RTO) node or an undefined RTO node. Each directed edge directly connects two nodes and represents a time delay between the two nodes. The nodes are topologically sorted to order the nodes in a dependency sequence of ordered nodes. A corrected RTO is computed for each ordered node after which an estimated RTO is calculated as a calculated RTO for each remaining undefined RTO node. The ordered nodes in the dependency sequence are reordered according to an ascending order of the corrected RTO of the ordered nodes to form a timing sequence for activating the unique resources represented by the multiple nodes.

Abstract: A method, computer program product, and computer system for generating a timing sequence for activating resources linked through time dependency relationships. A Direct Acyclic Graph (DAG) includes nodes and directed edges. Each node represents a unique resource and is a predefined Recovery Time Objective (RTO) node or an undefined RTO node. Each directed edge directly connects two nodes and represents a time delay between the two nodes. The nodes are topologically sorted to order the nodes in a dependency sequence of ordered nodes. A corrected RTO is computed for each ordered node after which an estimated RTO is calculated as a calculated RTO for each remaining undefined RTO node. The ordered nodes in the dependency sequence are reordered according to an ascending order of the corrected RTO of the ordered nodes to form a timing sequence for activating the unique resources represented by the multiple nodes.

Abstract: A method and system for analyzing impact of an event on resources of a network. A directed graph is generated and includes nodes and edges. Each node represents a resource. Each edge connects, and is directed from, a predecessor node to a successor node. The event impacts the resource at an event node. A propagation time (PT) is determined for each edge. The PT is a time interval for an impact of the event to travel along each edge from the predecessor node to the successor node. An initial estimated impact time (EIT) is set for each node. The EIT for each node is an estimated time at which the event impacts each node. The EIT of each node that is directly or indirectly connected to the event node by one or more edges is updated. A list of the updated nodes is sent to an output device.

Abstract: A method and system for analyzing impact of an event on resources of a network. A directed graph is generated and includes nodes and edges. Each node represents a resource. Each edge connects, and is directed from, a predecessor node to a successor node. The event impacts the resource at an event node. A propagation time (PT) is determined for each edge. The PT is a time interval for an impact of the event to travel along each edge from the predecessor node to the successor node. An initial estimated impact time (EIT) is set for each node. The EIT for each node is an estimated time at which the event impacts each node. The EIT of each node that is directly or indirectly connected to the event node by one or more edges is updated. A list of the updated nodes is sent to an output device.

Abstract: A method, computer program product, and computer system for generating a timing sequence for activating resources linked through time dependency relationships. A Direct Acyclic Graph (DAG) includes nodes and directed edges. Each node represents a unique resource and is a predefined Recovery Time Objective (RTO) node or an undefined RTO node. Each directed edge directly connects two nodes and represents a time delay between the two nodes. The nodes are topologically sorted to order the nodes in a dependency sequence of ordered nodes. A corrected RTO is computed for each ordered node after which an estimated RTO is calculated as a calculated RTO for each remaining undefined RTO node. The ordered nodes in the dependency sequence are reordered according to an ascending order of the corrected RTO of the ordered nodes to form a timing sequence for activating the unique resources represented by the multiple nodes.

Abstract: A state engine system is disclosed. The system includes: a CPU and a memory operatively connected to the CPU, the memory including a program adapted to be executed by the CPU and the CPU and memory cooperatively adapted for managing a plurality of objects stored in a database, whose behavior can be modeled by means of a state diagram reacting on external events which occur in a non-deterministic order. The system additionally includes code segment embodied on a computer-readable medium configured and adapted for creating, storing and maintaining state diagram templates in a database. The database includes all states available for the object, the possible state transitions, the events which cause state transitions, and the actions which occur upon state transitions. There is at least one event causing each state transition, and the actions which occur upon a state transition are dependent upon the event that caused the transition.

Abstract: A device operating as a finite state machine and provided for processing events and actions relating to at least one object to be moved between an initial and a final state. The device comprising a processing member connected to a memory. The initial and final states are integrated into at least one event-state-action diagram defining said finite state machine. The event-state-action diagram has a matrix structure where each event-state combination forms a matrix position. Actions formed by transitions, processing actions, and timed actions, are stored at the matrix positions. The processing member is further provided for retrieving the actions and for supplying the retrieved actions to an action dispatcher in order to execute the actions. The action dispatcher comprises, for each action of said third set, an execution routine provided for controlling the execution of the action.

Abstract: The invention includes a state engine system, the system including: a CPU; a memory operatively connected to the CPU, the memory containing a program adapted to be executed by the CPU and the CPU and memory cooperatively adapted for managing a plurality of objects stored in a database, whose behavior can be modeled by means of a state diagram reacting on external events which occur in a non-deterministic order.