A graphical user interface (GUI) scheduler program is provided for modeling business workflow processes. The GUI scheduler program includes tools to allow a user to create a schedule for business workflow processes based on a set of rules defined by the GUI scheduler program. The rules facilitate deadlock not occurring within the schedule. The program provides tools for creating and defining message flows between entities. Additionally, the program provides tools that allow a user to define a binding between the schedule and components, such as COM components, script components, message queues and other workflow schedules. The scheduler program allows a user to define actions and group actions into transactions using simple GUI scheduling tools. The schedule can then be converted to executable code in a variety of forms such as XML, C, C+ and C++. The executable code can then be converted or interpreted for running the schedule.

System and method utilizing a graphical user interface of a business process workflow scheduling program

In one aspect, the invention relates to a method to propagate relations between a first rule set and a second rule set wherein the first and second rule sets are invoked by a common workflow model. The method includes tracing paths forward through the workflow model from the first rule set to the second rule set. Enumerating relations that extend forward from the first rule set to the second rule set is another step in the method. Additionally, using multi-valued logic, calculating the effects to the relations of control flow through the workflow model from the first rule set to the second rule set, tracing paths backward through the workflow model from the first rule set to the second rule set, enumerating relations that extend backward form the second rule set to the first rule set, and using multi-valued logic, calculating the effects on the relations of control flow backwards through the workflow model from the second rule set to the first rule set are also steps in the method.

Relational logic management system

The increasing complexity of business processes in the era of e-business has heightened the need for workflow verification tools. However, workflow verification remains an open and challenging research area. As an indication, most of commercial workflow management systems do not yet provide workflow designers with formal workflow verification tools. We propose a logic-based verification method that is based on a well-known formalism, i.e., propositional logic. Our logic-based workflow verification approach has distinct advantages such as its rigorous yet simplistic logical formalism and its ability to handle generic activity-based process models. In this paper, we present the theoretical framework for applying propositional logic to workflow verification and demonstrate that logic-based workflow verification is capable of detecting process anomalies in workflow models.

Applying Propositional Logic to Workflow Verification

Resource constraints analysis of workflow specifications

To support deadlock detection by computer, five patterns which cause deadlock are defined. In expressing the pattern of deadlock structures by control-node combinations only, it is difficult to express the connection properties, since these are decided by many complex combinations of control nodes. Therefore, two new concepts, "reachability" and "absolute transferability", which express connection properties between two control nodes, are introduced. With these concepts, the five deadlock patterns are expressed simply. It is demonstrated mathematically that all deadlock structures can be classified into these patterns and that deadlock occurs in business process workflow models which have one or more of these patterns.

Definition of deadlock patterns for business processes workflow models

Proposes an algorithm which detects structures of deadlock which have deadlock occurrence possibility. This deadlock detection algorithm finds out all deadlock structures in the business processes workflow model by using deadlock patterns which express deadlock structures by combinations of nodes. There is the problem that some deadlock structures cannot be identified with some deadlock pattern because the deadlock structures cross each other when the algorithm finds deadlock patterns in the business processes workflow model. The problem can be solved by detecting the deadlock structures not by using each deadlock pattern but by using each of the unit into which the deadlock pattern is integrated.

A deadlock detection algorithm for business processes workflow models

A new method for selection of dispatching rules, called a status selection method is discussed. In this method, the most promising status is selected from tentative statuses that are generated by applying all dispatching rules. Since the dispatching rules and the knowledge of status selection are independent, it is easy to exchange the dispatching rules. From the result of the application of the proposed method to a simple flow shop problem, it is confirmed that the status selection method is effective. >

Dispatching rule exchangeable optimization planning system

To evaluate the control mechanism for a supply chain, simulation is one of the most effective methods. In a supply chain, however, the flows of work, transit and decision-making have complex interrelations, so that it is difficult to easily express a model for simulation. In this paper, the functions needed for supply-chain simulation and a tool equipped with these functions are proposed. By using this tool, modeling and simulating of the supply chain are supported. Flows of work, transit and decision-making are expressed in individually-defined forms, and they are connected and integrated to generate a whole supply-chain model.

Simulation tool of supply chain model with various structure and decision making processes

A job shop problem with group constraints is a problem where job schedule in each line is decided, and jobs dealt with the same process have to be grouped for every process of a line The minimum and maximum size restrictions exist in the total size of jobs in the group An evaluation function of this problem consists of an average manufactured time needed for completion of all jobs, a number of group changes, and a number of line rests This research consists of two parts: rapid generation of an initial solution by heuristics and improvement of solutions In the part of generation of an initial solution, the flexibility of each job according to an influential degree of a whole plan is defined In the part of improvement, rules, which can improve one of three evaluation items, are prepared By application of a taboo search, which can apply plural rules, total evaluation can be improved The proposed method has been applied to some real large-scale job shop problems with group constraints, and its effectiveness is confirmed

Yoshitomo Ikkai

Papers

Definition of deadlock patterns for business processes workflow models

A deadlock detection algorithm for business processes workflow models

Dispatching rule exchangeable optimization planning system

Simulation tool of supply chain model with various structure and decision making processes

A high speed scheduling method by analyzing job flexibility and taboo search for a large-scale job shop problem with group constraints