The present invention relates to computer processes, and more particularly to a system and method for modeling business workflow processes employing a graphical user interface.
Transaction processing systems have led the way for many ideas in distributed computing and fault-tolerant computing. For example, transaction processing systems have introduced distributed data for reliability, availability, and performance, and fault tolerant storage and processes, in addition to contributing to a client-server model and remote procedure call for distributed computation. Importantly, transaction processing introduced the concept of transaction ACID properties—atomicity, consistency, isolation and durability that has emerged as a unifying concept for distributed computations. Atomicity refers to a transaction's change to a state of an overall system happening all at once or not at all. Consistency refers to a transaction being a correct transformation of the system state and essentially means that the transaction is a correct program. Although transactions execute concurrently, isolation ensures that transactions appear to execute before or after another transaction because intermediate states of transactions are not visible to other transactions (e.g., locked during execution). Durability refers to once a transaction completes successfully (commits) its activities or its changes to the state become permanent and survive failures.
Many applications for workflow tools are internal to a business or organization. With the advent of networked computers and modems, computer systems at remote locations can now easily communicate with one another. This allows computer system workflow applications to be used between remote facilities within a company. Workflow applications can also be of particular utility in processing business transactions between different companies. Automating such processes can result in significant improvements in efficiency, not otherwise possible. However, this inter-company application of workflow technology requires co-operation of the companies and proper interfacing of the individual company's existing computer systems.
A fundamental concept of workflow analysis is that many business processes can be interpreted as a sequence of basic transactions called workflows. Workflows have a customer, a performer, and conditions of satisfaction. The customer and performer are roles that participants can take in workflows. In addition, workflows can have observers. In conventional business workflow systems, a transaction comprises a sequence of operations that change recoverable resources and data from one consistent state into another, and if a failure occurs before the transaction reaches normal termination those updates will be rolled back or undone. ACID transactions control concurrency by isolating atomic transitions against each other to create a serializable schedule by delaying updates until committing of transactions. This isolation limits granularity viewed by an observer to the size of the parent transactions until all child transactions commit within a parent transaction. Therefore, application specific programs cannot be invoked and monitoring of transactions by users cannot be performed based on any actions occurring within a transaction, until the transaction fails or commits.
The Unified Modeling Language (UML) defines a standard notation for representing flow charts for business workflow processes. However, the UML notation cannot be reduced to a programming language for employing complicated workflow processes. Current business workflow software systems provide scheduling software that requires binding within the scheduling to couple the schedule to real world applications and technologies. Conventional schedules require code to couple the components of the schedule to application program interface (API) objects and/or server objects for interfacing the schedule with systems within each business or department involved in the business process. These types of schedule software require sophisticated programmers to implement the software for a given business workflow model. Furthermore, these types of schedule software require modification of each schedule for different technologies.
Accordingly, there is an unmet need in the art for a system and/or method for providing a software tool for modeling a business workflow process that mitigates some of the aforementioned deficiencies associated with conventional software and modeling of business workflow processes.
The present invention relates to a graphical user interface (GUI) scheduler program 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.
A user is provided with a GUI schedule interface, which allows the user to create a schedule on a first side of the GUI and to define bindings on the other side of the GUI. During creation of the schedule, the scheduler program prohibits the user from creating a schedule that will deadlock the schedule by checking correctness of the schedule flow. In creating the binding, the GUI schedule program provides prompts for specifying interfaces and methods of the components being bound. A data flow connection sheet is provided based on the schedule messages and the binding component interfaces and methods. The data flow of messages is then defined by simply connecting the message ports to binding component interfaces to facilitate proper data flow between entities. It is to be appreciated that the separate data flow sheet could be combined into the GUI scheduler interface or provided via a pop up screen after defining binding component interfaces and methods.
According to one aspect of the invention, a workflow scheduler graphical user interface program is provided. The workflow scheduler graphical user interface program comprises a first screen area adapted to allow a user to create a graphical representation of a business workflow process and a second screen area adapted to allow a user to bind the graphical representation of a business workflow process to at least one technological component.
Another aspect of the invention relates to a business process scheduling program. The business process scheduling program comprises a plurality of schedule tool components adapted to allow a user to create a representation of a business process schedule according to a set of predefined rules. The scheduling program also comprises a conversion component adapted to convert the schedule created by the user to executable code.
Yet another aspect of the invention relates to a computer readable medium having computer-executable instructions for performing a computer methodology. The methodology comprises the steps of displaying a screen having a first region adapted to allow a user to create a representation of a business workflow process. The screen also has a second region adapted to allow a user to bind the representation of the business workflow process to at least one technological component.
According to a further aspect of the invention, a system is provided. The system facilitates modeling of business processes comprised of a plurality of business operations being representable at a transaction level and an action level. The system comprises a computer-readable medium and a plurality of computer-executable components. The components comprise a graphical user interface and a plurality of modeling components accessible through the graphical user interface. The plurality of modeling components are adapted to allow a user to create a graphical representation of a business process and a binding of the business process to at least one technological component.
Another aspect of the invention relates to a graphical user interface program. The graphical user interface program comprises means for allowing a user to create a graphical representation of a business process and means for allowing a user to create a binding of the graphical representation of the business process to at least one technological component.
To the accomplishment of the foregoing and related ends, the invention then, comprises the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative aspects of the invention. These aspects are indicative, however, of but a few of the various ways in which the principles of the invention may be employed and the present invention is intended to include all such aspects and their equivalents. Other objects, advantages and novel features of the invention will become apparent from the following detailed description of the invention when considered in conjunction with the drawings.
a illustrates a block diagram of a personal computer system in accordance with an environment of the present invention.
b illustrates a block diagram of an alternate computer system in accordance with an environment of the present invention.
a illustrates a UML interaction diagram of a simplified purchase interaction in accordance with one aspect of the present invention.
b illustrates a modeling interaction diagram of the simplified purchase interaction of
a illustrates an example of nested roles and transactions in accordance with one aspect of the present invention.
b illustrates an example of valid transaction nesting in accordance with one aspect of the present invention.
c illustrates an alternate example of valid transaction nesting in accordance with one aspect of the present invention.
d illustrates an example of invalid transaction nesting in accordance with one aspect of the present invention.
e illustrates an example of valid role nesting in accordance with one aspect of the present invention.
f illustrates an example of valid role and transaction nesting in accordance with one aspect of the present invention.
g illustrates an alternate example of valid role and transaction nesting in accordance with one aspect of the present invention.
a illustrates an example of a highlighted role in accordance with one aspect of the present invention.
b illustrates an example of a non-highlighted role in accordance with one aspect of the present invention.
c illustrates examples of legal role associations in accordance with one aspect of the present invention.
d illustrates an example of a role before association in accordance with one aspect of the present invention.
e illustrates an example of a role after association in accordance with one aspect of the present invention.
f illustrates an example of an illegal role association in accordance with one aspect of the present invention.
a illustrates an example of an action shape attached to an Implementation port in accordance with one aspect of the present invention.
b illustrates an example of a role dropped but not associated in accordance with one aspect of the present invention.
c illustrates an example of a role dropped and associated in accordance with one aspect of the present invention.
a illustrates an example of an associated role prior to port attachment in accordance with one aspect of the present invention.
b illustrates an example of an associated role after port attachment in accordance with one aspect of the present invention.
a illustrates an example of two roles with two communicates in accordance with one aspect of the present invention.
b illustrates an example of a deletion of the second role of
c illustrates an example of a deletion of the first role of
a illustrates an example of a (GUI) switch shape when first dropped onto a page in accordance with one aspect of the present invention.
b illustrates an example of the (GUI) switch shape of
a illustrates an example of a bound COM component in accordance with one aspect of the present invention.
b illustrates an example of a bound Script component in accordance with one aspect of the present invention.
c illustrates an example of a bound MSMQ component in accordance with one aspect of the present invention.
d illustrates an example of a bound schedule in accordance with one aspect of the present invention.
a illustrates an example of a (GUI) Method Message Editor for COM components in accordance with one aspect of the present invention.
b illustrates an example of a (GUI) XML Message Editor in accordance with one aspect of the present invention.
c illustrates an example of a (GUI) CALL Message Editor in accordance with one aspect of the present invention.
d illustrates an example of a (GUI) Port References Message Editor in accordance with one aspect of the present invention.
The present invention is now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. The present invention is described with reference to a system and method for modeling a business workflow process employing a graphical user interface (GUI) scheduler program. The GUI scheduler program provides tools for creating a schedule for business workflow process. The tools include constraints defined by a set of rules. The rules mitigate deadlock from occurring within the schedule. The tools allow binding of the schedule to technological components, such as COM components, Script components, Message Queue components and other schedules. The GUI schedule software allows a user to define actions and group actions into transactions. The schedule can then be converted to a programming language for execution.
One aspect of a system in accordance with the present invention is preferably practiced in the context of a personal computer (PC). A representative hardware environment is depicted in
b and the following discussion are intended to provide a brief, general description of a suitable computing environment in which the invention may be executed. While the invention will be described in the general context of computer-executable instructions of a computer program that runs on a server computer, those skilled in the art will recognize that the invention also may be implemented in combination with other program modules. Generally, program modules include routines, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including single- or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, hand-held computing devices, microprocessor-based or programmable consumer electronics, and the like. The illustrated aspect of the invention also is practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. But, some aspects of the invention can be practiced on stand-alone computers. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
With reference to
The system bus may be any of several types of bus structure including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of conventional bus architectures such as PCI, VESA, Microchannel, ISA and EISA, to name a few. The system memory includes read only memory (ROM) 124 and random access memory (RAM) 125. A basic input/output system (BIOS), containing the basic routines that help to transfer information between elements within the server computer 120, such as during start-up, is stored in ROM 124.
The server computer 120 further includes a hard disk drive 127, a magnetic disk drive 128, e.g., to read from or write to a removable disk 129, and an optical disk drive 130, e.g., for reading a CD-ROM disk 131 or to read from or write to other optical media. The hard disk drive 127, magnetic disk drive 128, and optical disk drive 130 are connected to the system bus 123 by a hard disk drive interface 132, a magnetic disk drive interface 133, and an optical drive interface 134, respectively. The drives and their associated computer-readable media provide nonvolatile storage of data, data structures, computer-executable instructions, etc. for the server computer 120. Although the description of computer-readable media above refers to a hard disk, a removable magnetic disk and a CD, it should be appreciated by those skilled in the art that other types of media which are readable by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, and the like, may also be used in the exemplary operating environment.
A number of program modules may be stored in the drives and RAM 125, including an operating system 135, one or more application programs 136, other program modules 137, and program data 138. The operating system 135 in the illustrated server computer is the Microsoft Windows NT Server operating system, together with the before mentioned Microsoft transaction Server.
A user may enter commands and information into the server computer 120 through a keyboard 140 and pointing device, such as a mouse 142. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 121 through a serial port interface 146 that is coupled to the system bus, but may be connected by other interfaces, such as a parallel port, game port or a universal serial bus (USB). A monitor 147 or other type of display device is also connected to the system bus 123 via an interface, such as a video adapter 148. In addition to the monitor, server computers typically include other peripheral output devices (not shown), such as speakers and printers.
The server computer 120 may operate in a networked environment using logical connections to one or more remote computers, such as a remote client computer 149. The remote computer 149 may be a workstation, a server computer, a router, a peer device or other common network node, and typically includes many or all of the elements described relative to the server computer 120, although only a memory storage device 150 has been illustrated in
When used in a LAN networking environment, the server computer 120 is connected to the local network 151 through a network interface or adapter 153. When used in a WAN networking environment, the server computer 120 typically includes a modem 154, or is connected to a communications server on the LAN, or has other means for establishing communications over the wide area network 152, such as the Internet. The modem 154, which may be internal or external, is connected to the system bus 123 via the serial port interface 146. In a networked environment, program modules depicted relative to the server computer 120, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
In accordance with practices of persons skilled in the art of computer programming, the present invention is described below with reference to acts and symbolic representations of operations that are performed by the server computer 120, unless indicated otherwise. Such acts and operations are sometimes referred to as being computer-executed. It will be appreciated that the acts and symbolically represented operations include the manipulation by the processing unit 121 of electrical signals representing data bits which causes a resulting transformation or reduction of the electrical signal representation, and the maintenance of data bits at memory locations in the memory system (including the system memory 122, hard drive 127, floppy disks 129, and CD-ROM 131) to thereby reconfigure or otherwise alter the computer system's operation, as well as other processing of signals. The memory locations where data bits are maintained are physical locations that have particular electrical, magnetic, or optical properties corresponding to the data bits.
a illustrates a simple purchase interaction diagram in a system with autonomous interacting agents employing a UML notation. The agents (e.g., customer, supplier and shipper) are autonomous in that their activities are concurrent and their lifetimes independent of one another. The interactions between the agents are manifested as exchanges of messages between each other (e.g., purchase orders, purchase order confirmations, ship order). The following example is centered on describing agents in terms of ordering of messages sent and received by the agents and modeling the entire system as a composition of individual agents. A completed purchase in which a product is received by the customer and the product paid for by the customer, represents a completed business workflow process.
The present invention will now be described with respect to a rule set associated with the GUI scheduling software 10. A dynamic connector tool can be enabled and resides on a toolbar menu and a flow chart stencil. The present invention supports one construction context with two applications: roles and transactions. The UI includes one shape for roles and one similar shape for transactions, that each translate to contexts in XML.
a illustrates the role shape highlighted, while
Referring now to
a–11c illustrate communication of a role with an implementation port. If a user drags the control flow control handle of a role that is associated to a shape that is not associated with the role, the system will delete the connection and present an error. The role's control flow will begin with an action associated with the role. The shape will be associated with the role and not with a role or transaction that is nested inside of the role. A role port is added on the outside of the role during the association process for each enclosed action shape that is attached to a port.
Referring to
a–14c illustrate communications between roles. Referring initially to
a illustrates two roles communicating. If the user deletes role 2, the system creates a diagram similar to the one illustrated in
Transactions have two additional properties that roles lack, that is enable compensation and enable catch. These properties can be enabled independently.
If an action is dropped, no ports or port-messages will be created. If an action is rewired to an existing port a new port message is created that can refer to an existing message or new message depending upon where connection is dropped. A user can connect an action within an associated role (from left or right side) to another action (left or right side) within another (different) associated role. Fields in the new message shape are added and populated from the information from the method (first method selected), if bound to a COM shape. Action to implementation port connectors can be selected and deleted. If any one of (action to role port, role port, role port to communicates message) are deleted, the entire communication connection is deleted (potentially leaving an unused message on the data page). If an action is deleted, any action to port connectors will be deleted, which may trigger a dangling communicates and the creation of a new implementation port.
a illustrates a switch shape that is provided for providing a decision component for the GUI scheduling program. The switch shape can map directly to an XML programming language component. The switch shape contains rule shapes. Rule shapes are uniquely named. Default rule names will be “Rule x” where x is an integer 1, 2, etc., similar to the auto naming of ports, actions, transactions, etc. Multiple switch shapes can contain the same rule. A specific rule will only be used once within a specific switch. Cleanup will delete rules that are no longer used in any switch shapes. Cleanup is a term used to refer to two menu options under the Tools menu. Each option deletes shapes. Each Switch shape always has one, un-editable, “Else” rule shape. When a switch shape is originally dragged onto the page, the only rule will be Default. A user will need to edit properties on the shape to add additional rules, such as the three new rules added to the switch shape illustrated in
a illustrates a bound COM component with a method breakout connector.
The UI provides a different message editor form for each binding technology. There is no enforcement of having one message flow to ports all bound to the same technology. When the user selects a message to edit on the business logic pages, the UI will display the message editor of the port within which the message was selected. If the message flows through ports of different binding types, when the user selects a message to edit on the data page, they will be presented with an option as to which message editor to use.
Every message has two system fields (“Result Status”, int) and (“Sender”, string). The user shall not be able to enter a default value for the “Result Status” or Sender field. In the Field display section of each message editor, Name and Data Type are not editable. Data Types are typically displayed as XML types, regardless of message editor. Field names are unique per message. For the name, each message editor has a combobox containing all existing messages to enable the user to say that this message is exactly another message. Each message editor will have a rename button to the right of the combobox to allow the user to rename the currently selected message. This rename/combox will be the same whether selected from the data or business logic pages. Message names are displayed as a textbox, on both the business logic and data pages. Unique name validation will be done when the user presses the “OK” button. This editor will allow the user to specify two schemas (.XML files). The Message fields frame appears identical to the Method message editor. The names and data types are populated from the top-level XML Elements in the Internal Schema specified in the Message Schema frame. The user will be able to select from all transactions on the page. With COM and Method bindings, the fields of the messages are automatically set to either the [in] or the [out] arguments of method they are pointed to in the port. With MSMQ bindings, the user will have to go into the message editor, specify an XML schema, and select nodes in the tree to populate the fields. With CALL bindings, the user will have to go and specify the ports, messages, and transactions being passed into the called schedule.
All data types displayed on the data page will be XML data types. The Data page has one intrinsic message called the port references message that represents all of the ports on the business logic page with a field within the message. Visually, each field will have data type “port”. Dynamic ports (those ports specified by the user in the wizard) will have connection points on the left. Field-to-Field connectors can terminate at these fields within the port references shape. All ports will have connection points/control handles on the right. Like any other message on the data page, there can be n number of Field-to-Field connectors starting at any field within the port references message. The port references message shall be updated each time a new port is added, deleted, or edited (name change). The shape shall add, delete or modify the appropriate field shape and its information. The user shall be able to change the relative order of the fields in the port references message for readability. The lines into and out of the port references shape will be visually different from other connectors on the data page.
The business workflow process models created by the GUI scheduling software can be reduced to a programming language. The models created employing the GUI scheduling software of the present invention will now be illustrated with respect to an example of a business workflow process reduced to a scheduling programming language written in XML (hereinafter referred to as SLANG) including syntax that allows for expression of features associated with the model of the present invention. The programming language allows for users to choose between conventional features of business workflow processes and model specific features in formulating custom models for the user's particular business workflow process. The language is inherently concurrent and allows a user to specify dependency and independence between components, transaction, compensation and checkpoint boundaries, as well as mechanisms for abstracting the workflow from the implementations of the components.
Although, the present example refers to a scheduling language, it is to be appreciated that the present invention can apply to a variety of application programming languages and is not specifically limited to a scheduling language. The scheduling language provides a mechanism for describing and executing concurrent instances of components. The actions can be mapped to invocations on, for example, common object model (COM) objects, messages in queues, or other native technology behavior. The schedule easily maps onto a distributed environment due to its inherent concurrency, and can further be used to compose other schedules. A schedule can be examined at design time for deadlocks. A compiler can detect deadlock conditions between concurrent actions. A schedule can be stored on a file system, in a database, or embedded in a stream in an application. It is to be appreciated that variation of the business workflow process described herein and the programming language implementing the example would be apparent to those skilled in the art.
It is to be appreciated that the components in the GUI scheduler program can be mapped to a variety of different programming languages, such as those written in basic, C, C+ or C++. It is also to be appreciated that any programming methodology and/or computer architecture suitable for carrying out the present invention may be employed and are intended to fall within the scope of the hereto appended claims.
The invention has been described with reference to specific aspects. Obviously, modifications and alterations will occur to others upon reading and understanding the foregone detailed description. It is intended that the invention be construed as including all such modifications alterations, and equivalents thereof.
Number | Name | Date | Kind |
---|---|---|---|
5261069 | Wilkinson et al. | Nov 1993 | A |
5524241 | Ghoneimy et al. | Jun 1996 | A |
5576946 | Bender et al. | Nov 1996 | A |
5581691 | Hsu et al. | Dec 1996 | A |
5630069 | Flores et al. | May 1997 | A |
5706429 | Lai et al. | Jan 1998 | A |
5734837 | Flores et al. | Mar 1998 | A |
5745901 | Entner et al. | Apr 1998 | A |
5774661 | Chatterjee et al. | Jun 1998 | A |
5835898 | Borg et al. | Nov 1998 | A |
5870545 | Davis et al. | Feb 1999 | A |
5918218 | Harris et al. | Jun 1999 | A |
5930512 | Boden et al. | Jul 1999 | A |
5940839 | Chen et al. | Aug 1999 | A |
5960420 | Leymann et al. | Sep 1999 | A |
5999911 | Berg et al. | Dec 1999 | A |
6009405 | Leymann et al. | Dec 1999 | A |
6073109 | Flores et al. | Jun 2000 | A |
6225998 | Okita et al. | May 2001 | B1 |
6233537 | Gryphon et al. | May 2001 | B1 |
6253369 | Cloud et al. | Jun 2001 | B1 |
6262729 | Marcos et al. | Jul 2001 | B1 |
6606740 | Lynn et al. | Aug 2003 | B1 |
6725428 | Pareschi et al. | Apr 2004 | B1 |
6968503 | Chang et al. | Nov 2005 | B1 |
20010044738 | Elkin et al. | Nov 2001 | A1 |
20020035584 | Scheier et al. | Mar 2002 | A1 |
20040078373 | Ghoneimy et al. | Apr 2004 | A1 |
Number | Date | Country |
---|---|---|
WO 9847068 | Apr 1998 | WO |