Diagram Based Strategies for the Representation and Examination of Business Work processes.


119 views
Uploaded on:
Category: News / Events
Description
To portray an AND/OR diagram representation plan for business work processes. To present a chart traversal calculation for the investigation of data stream in such work processes ...
Transcripts
Slide 1

Chart Based Methods for the Representation and Analysis of Business Workflows Amitava Bagchi Indian Institute of Management Calcutta

Slide 2

References Mukherjee Arindam, Sen Anup K and Bagchi Amitava (2004), Information investigation in work processes spoke to as assignment priority metagraphs, Proc WITS-2004 , Workshop on Information Technology and Systems, Seattle, WA, USA, pp 32-37 Mukherjee Arindam, Sen Anup K and Bagchi Amitava (2005), Representation, Analysis and Verification of Business Processes: A Metagraph-Based Approach, Working Paper WPS-552 , Indian Institute of Management Calcutta ( http://www.iimcal.ac.in ) ISI_Dec_05

Slide 3

Outline Business Process & Workflow Metagraphs & Information Elements Task Precedence Metagraphs (TPMGs) Information Analysis: Graphical Algorithm Functional & Organizational Perspectives Workflow Verification ISI_Dec_05

Slide 4

Objectives To depict an AND/OR diagram representation plan for business work processes To introduce a chart traversal calculation for the examination of data stream in such work processes To extend the above strategy to undertaking and asset examinations To blueprint how the auxiliary rightness of work processes can be checked ISI_Dec_05

Slide 5

Business Process & Workflow A business process comprises of an arrangement of related errands in one or more utilitarian territories, (for example, back or showcasing), which, when performed in any of a few admissible requests, empowers an association to accomplish a business objective. Ex: An advance evaluation framework utilized as a part of a bank ISI_Dec_05

Slide 6

Loan Appraisal: Business Process Example ISI_Dec_05

Slide 7

Legend (see fig p 6) PD candidate\'s property information CD information on practically identical properties AC candidate\'s record information APD advance application information AV assessed estimation of property CR candidate\'s FICO assessment LA credit sum RLA updated advance sum LR hazard level of advance AR, MR, BR the advance danger level is adequate, hardly awful, terrible BP current arrangement of bank\'s advances RE bank\'s present advance introduction YES the application is affirmed NO the application is rejected ISI_Dec_05

Slide 8

Business Process & Workflow ( or Workflow Instance) : A particular occurrence of stream of control in a business process; it is a sub-chart of the given procedure diagram by and by, the terms business procedure and work process are regularly utilized conversely. ISI_Dec_05

Slide 9

Workflow Instance 1 ISI_Dec_05

Slide 10

Workflow Instance 2 ISI_Dec_05

Slide 11

Workflow Instance 3 ISI_Dec_05

Slide 12

Business Process Modeling: Existing Approaches Petri Nets & Related Formalisms Petri Nets (van der Aalst & van Hee 2002) Workflow Management Coalition (WfMC) Guidelines ( http://www.wfmc.org ) Metagraph-Based Formalisms Metagraphs (Basu & Blanning 2000, 1999, 1994) ISI_Dec_05

Slide 13

Petri Nets & Related Formalisms Main center is on the priority connections between assignments Flow of data assumes a backup part Commercial items, for example, IBM\'s MQSeries have received this tradition Widely utilized, and very appropriate for designing applications ISI_Dec_05

Slide 14

Metagraph-Based Formalisms A metagraph is a coordinated (hyper-)chart. It can be seen as an uncommon sort of AND/OR chart. A metagraph is normally little in size (at most a couple of hundred hubs) and is expressly accessible, i.e. , the whole diagram is supplied as info to a hunt calculation. So the extension of a hub just means moving to its quick successors. In (certain) amusement trees, new hubs really get added to the diagram as they get made. ISI_Dec_05

Slide 15

Metagraph-Based Formalisms Each hub in a metagraph contains one or more data components ( things ). In Information Analysis, a data set of things is supplied at begin, indicating the business data at first accessible . Another arrangement of things, called the yield set , contains the objective arrangement of things that are coveted as yield. ISI_Dec_05

Slide 16

Metagraph-Based Formalisms Each circular segment speaks to an assignment that proselytes one arrangement of things to another arrangement of things. The goal is to begin from the information set of things, perform the assignments in the given request of priority and infer every one of the things in the yield set. ISI_Dec_05

Slide 17

Metagraph-Based Formalisms The metagraph tradition puts more accentuation on the stream of data, so has preference over Petri Nets for business applications. In any case, it is not generally utilized as a part of practice since it experiences certain deficiencies. ISI_Dec_05

Slide 18

e Metagraph for Loan Evaluation Process 1 Calculate Account Credit Data (AC) Rating Credit Rating (CR) Marg . Terrible e 4 k 8 s i Risk (MR) R l Calculate an Applicant n t n i g e r m a s M e Loan s Data (APD) s A Risk Loan Risk (LR) An e c A B c s a 9 e Appr .Value s A d p r o v e p e R s e t h i e (AV) e L s a s o a Loan n k b m 7 1 l 0 An e Approved e s d n s e s t R s i (YES) s a 5 i y r s t m w n e L o a n r p C a l c u l a t e an e k e 2 p n p A t o u n t A m r e t P an Accept f l o u c e l Risk (AR) Loan u a l Bad C a V Amt . (LA) Risk (BR) R e j A 6 e 1 p L c e t a 1 l c u t l p an o C l Property Risk t an i k h c s n i R s " k e n an a B Data (PD) Exposure i t e r u o s o p x E n (RE) Loan Comparables Bank\'s Rejection Data (CD) Portfolio (NO) (BP)

Slide 19

Metagraphs The current metagraph model for work processes has three principle deficiencies: Flow of control is not showed with clarity and the outline seems messed The examination makes utilization of typical networks which are difficult to control An unmistakable qualification is not generally drawn between OR joins & AND joins (or even between OR parts & AND parts) ISI_Dec_05

Slide 20

Task Precedence Metagraphs (TPMGs) A TPMG is an altered type of metagraph. It is outwardly all the more engaging and is more similar to an AND/OR chart in appearance. It is less jumbled so the stream of control is perceived all the more effortlessly. A TPMG is more broad than a WfMC diagram in that AND & OR parts and joins are not generally required to be coordinated in sets. ISI_Dec_05

Slide 21

Terminology Tasks & Propagation Edges Init Nodes & Prop Nodes OR Nodes & AND Nodes Split Nodes & Join Nodes ISI_Dec_05

Slide 22

Task Precedence Metagraphs (TPMGs) Edges are of two sorts: Tasks : appeared as striking bolts; an undertaking changes over the arrangement of things at its begin to another arrangement of things, which can\'t be gotten from some other assignment Propagation Edges : appeared as delicately drawn bolts; a proliferation edge passes on a thing from the active end of an errand to the approaching end of another undertaking. ISI_Dec_05

Slide 23

Task Precedence Metagraphs (TPMGs) Nodes are likewise of two sorts Init Nodes An init hub has a solitary active edge relating to an assignment Is appeared as a strong oval Prop Nodes A prop hub can have numerous active edges, all of which are proliferation edges Is appeared as a gently drawn oval ISI_Dec_05

Slide 24

Task Precedence Metagraphs (TPMGs) Init and Prop Nodes On each coordinated way, init hubs interchange with prop hubs, i.e. , a TPMG is a coordinated bipartite diagram, much the same as a Petri net. ISI_Dec_05

Slide 25

Task Precedence Metagraphs (TPMGs) Nodes are of two sorts, OR AND . An OR hub (related to a + sign) indicates substitute ways for stream of control. An AND hub (related to a • sign) demonstrates that stream of control happens along all the edges in the meantime. An (or AND) hub is either a split hub or a join hub . ISI_Dec_05

Slide 26

Task Precedence Metagraphs (TPMGs) Split & Join Nodes A split hub is a hub at which various ways start. It is dependably a prop hub. A join hub is a hub at which numerous ways end. It is dependably an init hub. ISI_Dec_05

Slide 27

Task Precedence Metagraphs (TPMGs) However, a TPMG contrasts from a Petri Net in that each hub has a related subset of marked things. This underscores the part of business data in a business process. ISI_Dec_05

Slide 28

Information Analysis Given a work process, we look for answers to inquiries of the accompanying sort: Suppose a set An of things is supplied. Beginning from A , would we be able to deliver every one of the things in another given set B ? Is thing " a\' crucial for delivering thing " b\' ? These can be figured as diagram pursuit issues. ISI_Dec_05

Slide 29

Information Analysis But a standard AND/OR chart seek calculation, for example, AO* (Nilsson 1980) is not proper for our motivation in light of the fact that a TPMG varies from an AND/OR diagram in some ways: TPMG: Multiple begin hubs AND/OR Graph: One begin hub ISI_Dec_05

Slide 30

Information Analysis TPMG: Both AND joins as well as joins AND/OR Graph: Only OR joins TPMG: Can have coordinated cycles AND/OR Graph: AO* accept it is without cycle Note that a venture planning system has just AND parts/joins and no OR parts/joins ISI_Dec_05

Slide 31

Algorithm InfAnalysis Algorithm InfAnalysis is an iterative chart look calculation Given: An express TPMG A data set of things A yield (target) set of things Determines whether every one of the things in the yield set can be inferred. ISI_Dec_05

Slide 32

Algorithm InfAnalysis Algorithm InfAnalysis has a few similitudes with A* and AO* and makes utilization of an edge-checking technique. We think about the given TPMG as speaking to a business process, and the checked arrangement sub-diagram delivered by InfAnalysis as a work process case. ISI_Dec_05

Slide 33

Algorithm InfAnalysis Makes utilization of four records: ITEMSET: at first contains the info set of things; new things get included as hubs get extended TARGET: contains the things craved as yield FRONTIER: just holds init hubs; at first holds those that have every one of their things in ITEMSET STACK: required for handling OR hubs; recalls which OR option ought to be prepared next ISI_Dec_05

Slide 34

Algorithm InfAnalysis A dynamic hub is an init hub in FRONTIER with

Recommended
View more...