1 / 22

Workflow Discovery from Empirical Data

Workflow Discovery from Empirical Data. Laura Maruster, Stefan Maruster, Silviu Nanau. Some question marks…. What is workflow management? Why using Petri Nets? What is wrong with today’s methods? An overview of our method Discussion and future development. What is Workflow Management?.

phyre
Télécharger la présentation

Workflow Discovery from Empirical Data

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Workflow Discovery from Empirical Data Laura Maruster, Stefan Maruster, Silviu Nanau

  2. Some question marks… • What is workflow management? • Why using Petri Nets? • What is wrong with today’s methods? • An overview of our method • Discussion and future development

  3. What is Workflow Management? • It is the solution for problems as: • Controlling • Monitoring • Optimizing • Supporting Many organizations with complex business processes have identified the need for concepts, techniques, and tools to support the management of work flows. Thus, the term of workflow management was born. a business process

  4. A historical perspective W. van der Aalst (Eindhoven)

  5. Why using Petri Nets? Four main reasons: • Possible mathematical model for complex processes (parallel branches) • Formal semantics despite the graphical nature. • State-based instead of event-based. • Abundance of analysis techniques.

  6. What is wrong with today’s methods? • Takes a lot of time • Models are often incomplete • Models are not flexible enough

  7. An overview of our method The basic idea of our algorithm supposes three main steps: • Identify the pairs (x,y) that are in direct succession according with an abstract preordering operator. • Using selected pairs (x,y) built a preliminary net. • Merge all places that have non-concurrent input or output transitions.

  8. Step 1 • These pairs are put into tow sets: • The set of pairs where y appears after x, but x does not appear after y (R ) • The set of pairs where y appears after x, and x appears after y (R )

  9. Step 2 Using pairs from R , built the preliminary net. At this stage, the selected pairs are connected and a place is inserted between the connected relations.

  10. Step 3 Apply the following algorithm to build the final net, which merges all places that have non-concurrent input or output transitions. • N:=(P,T,F) • While M(N)≠Φ do (P1,P2)?M(N) N:=merge(N,{P1,P2}) od • NWL=N

  11. Definitions 1. Let A be a set of observable actions. A workflow log is a set of sequences over A, i.e. WLA*, where A*is the set of all sequences that are composed of zero or more actions of A.

  12. Definitions 2.For any sequence sA*, with s=(a1,a2,…,an) we have: • (s)={a1,a2,…,an} is the alphabet of s • (s)={(a1,a2),(a1,a3),…,(a1,an),(a2,a3),…,(an-1,an)} • first(s)=a1 • last(s)=an

  13. Definitions 3. (R ,R ,): Let WL be a workflow over A. We consider the following relations: • Let pref be the normal ordering on sequences and (a;b) the projection on {a;b}*. Define a preorder  on A* which requires the relative order of elements a and b which are in conflict, i.e., (a;b)I, to be the same when ignoring other elements of the sequences. Formally: uv if and only if ((a; b)I: (a;b)(u) pref(a;b)(v))

  14. Definitions 3 (cont.) • R ={(x,y)A×A | sWL, (x,y)(s)  sWL,(y,x)(s)} • R ={(x,y)A×A | sWL, (x,y)(s)  sWL,(y,x)(s)}

  15. Definitions 4. (N0WL) Let WL be a workflow log, and R , R as Defined. Then: N0WL=(P,T,F) where • T=(s) • P=R {i,o} • F={(i,t)(P×T)| sWL, t=first(s)} {(t,o)(T×P)| sWL, t=last(s)} {((x,y),t)(R ×T) | y=t,xy}{(t,(x,y))(T×R )|x=t,xy} sWL

  16. Definitions 5. Let N=(P,T,F) be a Petri net and XP a set of places. Then merge(N,X)=(P',T,F'),where • P'=(P\X){PX} • F'=F(P'×P'){(PX,t)}|tTpX,(p,t)F} {(t,PX)}|tTpX,(t,p)F}

  17. Definitions 6. Let WL be a workflow log, N0WL and R as defined. • M(N):={(P1,P2)P×P|(P1P2t1P1, t2P2,(t1,t2)R ) (P1,P2)P×P|(P1P2t1P1, t2P2,(t1,t2)R )} for any Petri net N=(P,T,F)

  18. An Example Practically, we have a set of traces: • {s,f,h,g,i,k,o} • {s,b,c,d,e,j,o} • ...

  19. An Example  s 1 1’ b f 2 2’ 3 4 c d g h 5 6 9 e i 7 7’ 8 j k 10 10’ o

  20. Discussion • Preliminary work • Works well for sound WF without cycles • Future directions • Final goal: a robust tool

  21. References • Laura Maruster – Automated discovery of Workflow Models from Hospital Data • K. Hayes and K. Lavery. Workflow management software: the business opportunity. • T.M. Koulopoulos. The Workflow Imperative. Van Nostrand Reinhold, New York, 1995. • W.M.P. van der Aalst. Three Good reasons for Using a Petri-net based Work on Management System. Proceedings of the International Working Conference on Information and Process Integration in Enterprises (IPIC96), pp. 179:201, Camebridge, Massachusetts, Nov 1996.

  22. References • W.M.P. van der Aalst: The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and Computers 1998 • C.A. Ellis, K. Keddara, G. Rozenberg. Dynamic Change within Workflow Systems. Conf. on Organizational Computing Systems, pp. 10:21, ACM SIGOIS, Aug. 1995

More Related