Abstract: A system and associated method for hierarchically decomposing a workflow graph G into a process structure tree PST. The workflow graph G is a two-terminal graph parsed into a tree T having triconnected components. Boundary pairs of all triconnected components in T are computed and fragments are discovered with boundary pairs. T is restructured into PST pursuant to categories of triconnected components in T. PST is deterministic and modular. PST represents a block-based process model that has fine blocks of execution units. PST is computed in time linear to the number of edges in G.

Abstract: Methods and apparatus are provided for production of a difference log in a data processing system. The difference log defines differences between process models defined in system memory. For each of the process models, model structure data provided in memory defines a hierarchy of SESE regions representing the structure of that model. Also provided in memory are model comparison data defining correspondences between elements of the models, and region comparison data defining correspondences between regions of the SESE region hierarchies for the models. The model comparison and region comparison data are analyzed to identify differences between the SESE region hierarchies, and a difference log defining said differences is produced. In preferred systems, the model structure data and the region comparison data are computed for the models, and the difference log has a hierarchical structure corresponding to the structure of the process models.

Abstract: Techniques for composition of model transformations from a predetermined set of model transformations. A state machine is provided in memory. The states are defined in the state machine in terms of predetermined model attributes. In response to specification of a target state for an input model to be transformed, an execution sequence in the state machine, between a start state corresponding to the input model and an end state corresponding to the specified target state, is selected. Each transformation in the selected sequence is then successively executed on the input model. After executing each transformation in the selected sequence, the transformed input model state is compared to the model state defined in the state machine to determine if the selected sequence is inoperable for the input model. If so, an alternative execution sequence in the state machine, between the input model state and the specified target state, is selected.

Abstract: A system and associated method for hierarchically decomposing a workflow graph G into a process structure tree PST. The workflow graph G is a two-terminal graph parsed into a tree T having triconnected components. Boundary pairs of all triconnected components in T are computed and fragments are discovered with boundary pairs. T is restructured into PST pursuant to categories of triconnected components in T. PST is deterministic and modular. PST represents a block-based process model that has fine blocks of execution units. PST is computed in time linear to the number of edges in G.

Abstract: Methods and apparatus are provided for production of a difference log in a data processing system The difference log defines differences between process models defined in system memory. For each of the process models, model structure data provided in memory defines a hierarchy of SESE regions representing the structure of that model. Also provided in memory are model comparison data defining correspondences between elements of the models, and region comparison data defining correspondences between regions of the SESE region hierarchies for the models. The model comparison and region comparison data are analyzed to identify differences between the SESE region hierarchies, and a difference log defining said differences is produced. In preferred systems, the model structure data and the region comparison data is computed for the models, and the difference log has a hierarchical structure corresponding to the structure of the process models.

Abstract: A system for combining quality assurance and model transformations in a business-driven development environment includes a host system executing a business modeling application, a transformation framework including a transformation programming interface (TPI) and a quality assurance framework executing on top of the business modeling application, and a plurality of transformation plug-in tools in communication with the TPI. The TPI includes options for model access and traversal, model element creation/removal, model element property editing and analysis. The options are applied to the transformations, via the selected transformation plug-in tools, to a business model resulting in a modified business model that conforms to an information technology (IT)-based executable code.

Abstract: Techniques for composition of model transformations from a predetermined set of model transformations. A state machine is provided in memory. The states are defined in the state machine in terms of predetermined model attributes. In response to specification of a target state for an input model to be transformed, an execution sequence in the state machine, between a start state corresponding to the input model and an end state corresponding to the specified target state, is selected. Each transformation in the selected sequence is then successively executed on the input model. After executing each transformation in the selected sequence, the transformed input model state is compared to the model state defined in the state machine to determine if the selected sequence is inoperable for the input model. If so, an alternative execution sequence in the state machine, between the input model state and the specified target state, is selected.