• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
BPMN process views construction
 

BPMN process views construction

on

  • 833 views

Sira Yongchareon, Chengfei Liu, Xiaohui Zhao, Marek Kowalkiewicz: BPMN Process Views Construction. In: DASFAA 2010:550-564

Sira Yongchareon, Chengfei Liu, Xiaohui Zhao, Marek Kowalkiewicz: BPMN Process Views Construction. In: DASFAA 2010:550-564

Statistics

Views

Total Views
833
Views on SlideShare
833
Embed Views
0

Actions

Likes
1
Downloads
13
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    BPMN process views construction BPMN process views construction Presentation Transcript

    • BPMN Process Views Construction Sira Yongchareon 1 , Chengfei Liu 1 , Xiaohui Zhao 1 , and Marek Kowalkiewicz 2 1 Centre for Complex Software Systems and Services Swinburne University of Technology, Australia 2 SAP Research Centre, Australia
    • Outline
      • Introduction
      • Related work and Problems
      • Constructing Process Views
      • Related work
      • Conclusion
      • BPMN Model
      • Process Views Construction
      • Related Work
      • Conclusion
    • Introduction
      • Process (workflow) Views
        • an abstraction of base process by hiding / aggregating activities
        • improve the privacy protection, authority control, flexible display, collaborative process modelling
      *Figure taken from Shen, M and Liu, D 2003
    • Related work
      • Ordering-preserved process view approach (Liu and Shen, 2003)
        • Rules : membership , atomicity , and order preservation
      • Building and visualizing personalized views of managed processes (Bobrik, Reichert et al, 2007)
        • Visualization approach to tackle inflexibility of building and visualizing personalized views of managed processes : reducing and aggregating
      • Customized process view (Grefen and Eshuis, 2008)
        • Process provider to construct process views - aggregation
        • Process consumer to filter unwanted information – activity hiding
    • BPMN Process models
    • BPMN Process models (Collaboration)
    • Problems
      • BPMN characteristic not considered in previous works
        • More complex than other process models, e.g., events, exception handling
        • Allow arbitrary modelling (non block-structure)
      • View construction more challenged
        • Aggregation for non-well-structured process
        • Selective aggregation of branches – not all branches of the gateways
        • Minimal aggregation solution
    • BPMN Process Model (Core)
      • Definition: BPMN process bp is tuple ( O, T , T E , G , E , F ) where,
        • O is a finite set of BPMN element objects divided into disjoint sets of T , G, and E
        • T is a finite set of tasks
        • G is a finite set of gateways
        • E is a finite set of events in bp ; event_type : E  { Start , Catching-Intermediate , Throwing-Intermediate , End } is a function used to specify the type of event.
        • F  O  O is a finite set of control flow relations
        • T E  E  T is non-injective and non-surjective defining a finite set of attachment relations of intermediate catching events on tasks, called Event-attached task relation .
        • F * is reflexive transitive closure of F , written o i F * o j , if there exists a path from o i to o j .
          • o i ( F  T E ) * o j if there exists a path from object o i to o j via control flow relations F and event-attached task relations T E .
      • Function returns a set of all objects in all possible paths leading from o i via a control flow f i to o j via a control flow f j , such that  o i , o j  O ,  f i , f j  F, o i ( f i F * f j ) o j .
    • BPMN example
    • BPMN Process Model
      • Definition: Process fragment or P-fragment Pf is a tuple ( O', T' , T E ' , G' , E' , F', F in , F out ) where O'  O, T'  T, T E '  T E , G'  G, E'  E , F'  O'  O'  F, such that,
        •  e s  { E | event_type ( E ) =Start },  e e  { E | event_type ( E ) =End }, e s  E'  e e  E', i.e., Pf cannot contain any start or end event of bp
        •  F in , F out  F , F  (( O O' )  O' )= F in  F  ( O'  ( O O' ))= F out ; F in and F out are the set of entry flows and exit flows of Pf , respectively
        •  o i  O' ,  o m , o n  O' ,  o x  O O' ,  o y  O O' ,  ( o x, , o m )  F in ,  ( o n , o y )  F out , o x F'*o i  o i F'*o y , i.e., for every object o i in Pf . O' there exists a path from entry flow to o i and from o i to exit flow
        • for every object o  O' there exists a path p =( e s , … , f i, , …, o, …, f o , …, e e ) starting from e s to e e via f i  F in , o , and f o  F out
    • Constructing Process Views: Rules
      • Process View Consistency Rules
        • Rule 1: (Order preservation). For any two objects belonging to process views v 1 and v 2 , their execution order must be consistent if such objects exists in v 1 and v 2
        • Rule 2: (Branch preservation). For any two objects belonging to process views v 1 and v 2 , the branch subjection relationship of them must be consistent
        • Rule 3: (Event-attached task preservation). For any event-attached task relation belonging to v 1 and v 2 , an existence of all coherence objects on the exception path led from such attached event must be consistent
        • Rule 4: (Message flow preservation). For any message flow exists in v 1 and v 2 , the message flow relation of its source and target objects must be consistent
      • Aggregation Rules
        • Aggregation Rule 1: (Atomicity of aggregate). An aggregate behaves as an atomic unit of processing (task); therefore, it must preserve the execution order for every task and event within it, as well as between itself and the process.
        • Aggregation Rule 2: (Objects in exception path). If the task in event-attached task relation is in the aggregate then every object in its exception path must be hidden in the process view; thus, it is not considered to be in the aggregate
    • Constructing Process Views : Preliminary
      • Definition: Given a set of objects N  O in a process, a set of the least common predecessors ( lcp ) and the least common successors ( lcs ) of N are:
        • lcp ( N ) = { o p  O N |  o  N ( o p F * o  (  o q  O N ( o q F * o  o q F * o p )))}
        • lcs ( N ) = { o s  O N |  o  N ( oF * o s  (  o q  O N ( oF * o q  o s F * o q )))}
      • Functions lcpF ( N ) and lcsF ( N ) return the subset of outgoing flows of lcp ( N ) and incoming flows of lcs ( N ), respectively. (only contain the flows in F that flow into or out from N )
        • lcpF ( N ) = {  F |  o p  lcp ( N ),  o s  lcs ( N ),  o  N , ( o p , o )  F  | path ( o p o s ) | > 0}
        • lcsF ( N ) = {  F |  o s  lcs ( N ),  o p  lcp ( N ) ,  o  N , ( o, o s )  F  | path ( o p o s ) | > 0}
    • Constructing Process Views : lcp and lcs
      • Example if N ={ t 2 , t 3 }
        • lcp ( N ) = { g 1 }
        • lcs ( N ) = { g 4 , g 5 }
        • lcpF ( N ) = {( g 1 , t 2 ), ( g 1 , t 3 )}
        • lcsF ( N ) = {( g 2 , g 4 ), ( g 2 , g 5 ), ( g 3 , g 4 ), ( g 3 , g 5 )}
    • Process Structure validation
      • Definition: An enclosed P-fragment (EP-fragment) Pf ( O', T' , T E ' , G' , E' , F', F in , F out ) define a P-fragment of a process. If Pf has only one entry object and one exit object as its boundary, then it is enclosed
        • Function  Fwd ( f s , o y ) returns a set of objects by walking forward from f s to o y as well as from f s to the end event of the process
        • Function  Bwd ( f e , o x ) returns a set of objects by walking backward from f e to o x as well as from f e to the start event of the process.
      • Lemma 1: Given a set of objects N  O in a process bp ( O, T , T E , G , E , F ) , an EP-Fragment Pf ( O', T' , T E ' , G' , E' , F', F in , F out ) can be formed by N, if and only if,
        • i.e., the forward walks and backward walks of all combinations of lcpF and lcsF flows return the same result set identical to N in bp (1)
        •  f p  lcpF ( N ),  o  N , f p =( o x , o ), i.e., there exists only one entry object o x (2)
        •  f s  lcsF ( N ),  o  N , f s =(o, o y ) , i.e., there exists only one exit object o y (3)
    • Process Structure validation
      • Theorem 1: A P-fragment Pf ( O', T' , T E ' , G' , E' , F', F in , F out ) in a process bp ( O, T , T E , G , E , F ) can be aggregated if and only if it is enclosed.
      • Example:
        • Pf 1 has one entry object o 5 but it has two exit objects o 12 and o 14
        • Pf 2 has two entry objects o 3 and o 5 , and one exit object o 14 .
        • Pf 3 (selective branch, unenclosed) has two entry objects o 3 and o 9 , and one exit object o 16 .
        • Pf 4 (selective branch, enclosed) has only one entry object o 3 and one exit object o 16 .
    • Minimal Aggregate
        • Function minAgg ( O A ) returns a minimal set of objects that can be aggregated, and hides every object on exception paths
    • Minimal Aggregate
      • Theorem 2: A set of objects O A  O in a process bp ( O, T , T E , G , E , F ) satisfies all aggregation rules if and only if O A =minAgg ( O A ) .
      • Example
        • Pf1 cannot form an EP-fragment then the boundary is expanded to Pf2 (enclosed)
    • Prototype
      • FlexView for BPMN (& XPDL)
      and 1 BizAgi ™ Process Modeler 1 BizAgi ™ is the product of BIZAGI, http://www.bizagi.com
    • Conclusion
      • Constructing process views on BPMN to deal with the events and exceptions
      • Non-well structured process tackled by EP-fragment validation
      • Selective aggregation of branches feature
      • Minimal aggregate solution
    • Q & A
      • Thanks