Performance Evaluation of Business Processes through a Formal Transformation to SAN

Performance Evaluation of Business Processes through a Formal Transformation to SAN

Performance Evaluation of Business

Processes through a Formal

Transformation to SAN

Kelly Rosa Braghetto

1

, João Eduardo Ferreira

1

, Jean-Marc Vincent

2

1

_{Department of Computer Science}

2

_{Grenoble Informatics Laboratory}

Institute of Mathematics and Statistics

INRIA – MESCAL Project

University of São Paulo

Joseph Fourier University

Agenda

1

Business Processes

Modeling and Analysis

Performance Evaluation: Challenges and Objectives

2

Modeling Techniques Used in this Work

Business Process Model and Notation

Stochastic Automata Networks

3

Automated Conversion from Business Process Models to SAN

Structure of BPMN and SAN Models and their Operations

Conversion Algorithm (Example)

4

Conclusion

Contributions and Discussion

Other Related Works

Performance Evaluation of Business Processes through a Formal Transformation to SAN Business Processes

Modeling and Analysis

Business Process Management

Techniques, languages and tools to support process life cycle

Design,

Execution,

Monitoring,

Analysis

Why it is important to analyze business processes?

They are everywhere (e-commerce, e-government, production)

Thousands of people depend on their reliability

Qualitative Analysis

_{× Quantitative Analysis}

Verification (syntactical correction)

Validation (semantical correction)

Performance analysis

Performance Analysis of Business Processes

Common performance indices

Responsiveness – service and waiting times

Productivity – throughput

Utilization – utilization rate of resources

Quality of service, reliability

Possible approaches for performance evaluation

Measuring

Simulation

Performance Evaluation of Business Processes through a Formal Transformation to SAN Business Processes

Performance Evaluation: Challenges and Objectives

Business Process Modeling

Domain-specific languages

Business Process Model and Notation (BPMN), Event-driven

Process Chains (EPC), Unified Modeling Language (UML)

Do not have formal semantics and focus on control-flow

Hard to model resources and quantify modeled behaviors

Our approach: automated conversion to stochastic models

BPMN

_⇒

SAN (

Stochastic Automata Networks)

Association of time with tasks

Association of probabilities with alternative flows

Characterization of resource usage

Performance Evaluation of Business Processes

via Analytical Modeling

Create Business Process Model Gather Quantitative Aspects business process Create Stochastic Models Analyze Numerically Integrate Results set of SAN models performance indices numerical results BPMN model annotated model of process + resources

Performance Evaluation of Business Processes through a Formal Transformation to SAN Modeling Techniques Used in this Work

Business Process Model and Notation

Business Process Model and Notation (BPMN)

Shipment Process of a Hardware Retailer

Take out extra insurance Decide if normal post or special shipment Check if extra insurance is necessary Fill in a Post label Request quotes from carriers Assign a carrier & prepare paperwork Package Goods Move package to pick area Goods to ship Goods for pick mode of delivery 20% - Extra insurance required 100% - Post label (always required)

85% - Normal Post 15% - Special Carrier H ar dw ar e R et ai le r L og is ti cs M an ag er C le rk W ar eh ou se W or ke r A B C D E F _G H Average Execution Time A : 05 min B : 30 min C : 10 min D : 30 min E : 05 min F : 40 min G : 15 min H : 20 min

Stochastic Automata Networks (SAN)

Example of a 2-Component System

A

₁

A

₂

e

1

e

2

e

3

,

e

4

(π

2

)

e

4

(π

1

)

e

4

e

5

u

w

x

y

z

Event

Rate

e

1

τ

1

e

2

τ

2

e

3

τ

3

e

4

τ

4

e

5

f

f =











λ

1

, if A

1

is in state

x

0

,

if A

₁

is in state

y

λ

2

, if A

1

is in state

z

Performance Evaluation of Business Processes through a Formal Transformation to SAN Modeling Techniques Used in this Work

Stochastic Automata Networks

Underlying Continuous Time Markov Chain

A

₁

A

₂

e

1

e

2

e

3

,

e

4

(π

2

)

e

4

(π

1

)

e

4

e

5

u

w

x

y

z

τ

1

τ

1

τ

₂

τ

₂

τ

3

τ

3

τ

4

π

2

τ

₄

π

₁

λ

1

λ

2

xu

xw

zu

zw

yu

yw

Event

Rate

e

1

τ

1

e

2

τ

2

e

3

τ

3

e

4

τ

4

e

5

f

f =











λ

1

,

if A

1

is in x

0,

if A

1

is in y

λ

2

,

if A

1

is in z

BPMN Process Graph

Shipment Process of a Hardware Retailer

Take out extra insurance Decide if normal post or special shipment Check if extra insurance is necessary Fill in a Post label Request quotes from carriers Assign a carrier & prepare paperwork Package Goods Move package to pick area Goods to ship Goods for pick mode of delivery 20% - Extra insurance required 100% - Post label (always required)

85% - Normal Post 15% - Special Carrier H ar dw ar e R et ai le r L og is ti cs M an ag er C le rk W ar eh ou se W or ke r A B C D E F _G H Average Execution Time A : 05 min B : 30 min C : 10 min D : 30 min E : 05 min F : 40 min G : 15 min H : 20 min

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Structure of BPMN and SAN Models and their Operations

BPMN Process Graph

Shipment Process of a Hardware Retailer

Take out extra insurance Decide if normal post or special shipment Check if extra insurance is necessary Fill in a Post label Request quotes from carriers Assign a carrier & prepare paperwork Package Goods Move package to pick area v1 v2 v3 v4 v5 v6 v7 v8 v9 v10 _v 11 v12 v13 v14 _v15 v16 A B C D E F _G H S T 0.85 0.15 0.2 1.0

Well-Formed BPMN Process Graph

Vertices accessible from start event / access end event

Events

Tasks

[Task Name] [Task Name]

Gateways

Probabilities

p

1

p

1

p

2

p

2

p

3

p

3

p

1

+

p

2

+

p

3

=

1

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Structure of BPMN and SAN Models and their Operations

Well-Defined BPMN Model

An exclusive gateway does not join parallel sequence flows

A parallel gateway does not join exclusive sequence flows

An inclusive gateway only joins sequence flows originated by

another inclusive gateway (one-to-one correspondence)

p

1

p

1

p

2

p

2

· · ·

· · ·

· · ·

· · ·

· · ·

· · ·

Conversion Algorithm

Main Steps

1

Conversion of vertices of the BPMN process graph into

elementary SAN models

2

Operations of concatenation to join automata that model a

same sequence flow

3

Operations of reduction, to eliminate redundant or unnecessary

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Structure of BPMN and SAN Models and their Operations

From BPMN Objects to SAN Elementary Models

Start Event

s

v

1

v

2

A

s

v

1

v

2

Atomic Task

a

v

1

v

2

A

r

a

a

v

1

r

v

2

v

2

Exc. Gateway 1

v

1

v

2

(p

1

)

(p

n

)

v

_n+1

...

A

(p

1

)

(p

n

)

v

1

1

v

1

n

...

v

1

v

2

v

n+1

Exc. Gateway 2

v

1

v

2

...

A

v

1

v

1

v

2

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Structure of BPMN and SAN Models and their Operations

From BPMN Objects to SAN Elementary Models

Start Event

s

v

1

v

2

A

s

v

1

v

2

Atomic Task

a

v

1

v

2

A

r

a

a

v

1

r

v

2

v

2

Exc. Gateway 1

v

1

(p

n

)

v

_n+1

...

A

(p

n

)

v

1

n

...

v

1

v

n+1

Exc. Gateway 2

v

1

v

2

...

A

v

1

v

1

v

2

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Structure of BPMN and SAN Models and their Operations

From BPMN Objects to SAN Elementary Models

Start Event

s

v

1

v

2

A

s

v

1

v

2

Atomic Task

a

v

1

v

2

A

r

a

a

v

1

r

v

2

v

2

Exc. Gateway 1

v

1

v

2

(p

1

)

(p

n

)

v

_n+1

...

A

(p

1

)

(p

n

)

v

1

1

v

1

n

...

v

1

v

2

v

n+1

Exc. Gateway 2

v

1

v

2

...

A

v

1

v

1

v

2

From BPMN Objects to SAN Elementary Models

Start Event

s

v

1

v

2

A

s

v

1

v

2

Atomic Task

a

v

1

v

2

A

r

a

a

v

1

r

v

2

v

2

Exc. Gateway 1

v

1

v

2

(p

1

)

(p

n

)

v

_n+1

...

A

(p

1

)

(p

n

)

v

1

1

v

1

n

...

v

1

v

2

v

n+1

Exc. Gateway 2

v

1

v

2

...

A

v

1

v

1

v

2

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Structure of BPMN and SAN Models and their Operations

Operation 1 – State Merge (

B)

A

A[q

4

⊲ q

5

]

q

1

q

1

q

2

q

2

q

3

q

3

q

4

q

4

q

5

q

6

q

6

q

7

q

7

ℓ

₁

ℓ

1

ℓ

₂

ℓ

2

ℓ

3

ℓ

3

ℓ

4

ℓ

4

ℓ

5

ℓ

6

ℓ

6

ℓ

7

ℓ

7

e

1

e

1

e

2

e

2

_e

_e

₃

3

e

4

e

4

,

e

5

e

5

e

6

e

6

Operation 2 – State Suppression (

I)

Condition: |

outputs(q

₄

)| = 1

A

A[q

4

◮]

q

1

q

1

q

2

q

2

q

3

q

3

q

4

_q

₅

q

5

_q

₆

q

6

q

7

q

7

ℓ

1

ℓ

₁

ℓ

2

ℓ

2

ℓ

3

ℓ

3

ℓ

4

_ℓ

5

ℓ

₅

_ℓ

₆

ℓ

6

ℓ

₇

ℓ

₇

e

1

e

1

e

2

e

2

e

3

e

3

e

4

_e

5

e

5

e

6

e

6

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Structure of BPMN and SAN Models and their Operations

Operation 3 – Automata Concatenation (

)

A

₁

A

₂

A

₁

q

₁₄

⊞

q

₂₁

A

2

q

1

1

q

1

1

q

1

2

q

1

2

q

1

3

q

1

3

q

1

4

q

1

4

q

2

1

q

2

2

q

2

2

q

2

3

q

2

3

ℓ

1

1

ℓ

₁

₁

ℓ

1

2

ℓ

₁

₂

ℓ

1

3

ℓ

1

3

ℓ

1

4

ℓ

1

4

ℓ

₂

₁

ℓ

2

2

ℓ

₂

₂

ℓ

₂

₃

ℓ

2

3

e

1

1

e

1

1

e

1

2

e

1

2

e

1

3

e

1

3

e

2

1

e

2

1

e

2

2

e

2

2

e

2

3

Vertex Mappings – Shipment Process

v1 v2 _{v3 v4} v5 v6 v7 v8 v9 v10 v11 v12 v13 v14 v15 v16 A B C D E F G H S T 0.85 0.15 0.2 1.0

A

₁

v

1

v

2

s

11

s

12

v

1

S

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Conversion Algorithm (Example)

Vertex Mappings – Shipment Process

v1 v2 _{v3 v4} v5 v6 v7 v8 v9 v10 v11 v12 v13 v14 v15 v16 A B C D E F G H S T 0.85 0.15 0.2 1.0

A

₁

A

2

A

₃

v

1

v

2

v

2

v

2

v

2

v

2

v

3

v

13

s

11

s

12

s

21

s

22

s

31

s

32

v

1

v

2

S

Vertex Mappings – Shipment Process

v1 v2 _{v3 v4} v5 v6 v7 v8 v9 v10 v11 v12 v13 v14 v15 v16 A B C D E F G H S T 0.85 0.15 0.2 1.0

A

1

A

2

A

3

A

4

v

1

v

2

v

2

v

2

v

2

v

2

v

3

v

3

v

4

v

13

r

v3

s

11

s

12

s

21

s

22

s

31

s

32

s

41

s

42

s

43

v

1

v

2

v

3

A

r

A

S

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Conversion Algorithm (Example)

Vertex Mappings – Shipment Process

v1 v2 _{v3 v4} v5 v6 v7 v8 v9 v10 v11 v12 v13 v14 v15 v16 A B C D E F G H S T 0.85 0.15 0.2 1.0

A

1

A

2

A

3

A

4

A

7

A

8

A

9

A

10

v

1

v

2

v

2

v

2

v

2

v

2

v

3

v

3

v

4

v

4

v

12

v

12

v

13

v

6

v

6

v

6

v

61

v

61

_v

6¬1

v

62

v

62

v

6¬2

v

7

v

8

v

9

v

9

v

9

v

9

v

9

v

9

r

v3

s

11

s

12

s

21

s

22

s

31

s

32

s

41

s

42

s

43

s

71

s

72

s

73

s

74

s

81

s

82

s

83

s

84

s

91

s

92

s

101

s

102

v

1

v

2

v

3

v

6

/v

9

A

r

A

S

(0.2)

(0.8)

(1.0)

(0.0)

15)

Vertex Mappings – Shipment Process

A

₁

A

₂

A

3

A

₄

A

₅

A

6

A

7

A

8

A

₉

A

₁₀

A

11

A

12

A

13

A

14

A

15

A

16

A

17

A

18

A

19

v

1

v

2

v

2

v

2

v

2

v

2

v

3

v

3

v

4

v

4

v

4

v

41

v

42

v

5

v

5

v

6

v

6

v

6

v

6

v

61

v

61

_v

6¬1

v

62

v

62

v

6¬2

v

7

v

7

v

8

v

8

v

9

v

9

v

9

v

9

v

9

v

9

v

9

v

9

v

10

v

10

v

11

v

11

v

12

v

12

v

12

v

12

v

12

v

13

v

13

v

14

v

14

v

14

v

14

v

14

v

14

v

15

v

15

v

15

v

16

r

v3

r

v5

r

v7

r

v8

r

v10

r

v11

r

v13

r

v15

s

11

s

12

s

21

s

22

s

31

s

32

s

41

s

42

s

43

s

51

s

52

s

53

s

61

s

62

s

63

s

71

s

72

s

73

s

74

s

81

s

82

s

83

s

84

s

91

s

92

s

101

s

102

s

111

s

112

s

113

s

121

s

122

s

123

s

131

s

132

s

133

s

141

s

142

s

143

s

151

s

152

s

161

s

162

s

163

s

171

s

172

s

181

s

182

s

191

s

192

s

193

v

1

v

2

v

3

v

4

v

5

v

6

/v

9

v

7

v

8

v

10

v

11

v

12

v

13

v

14

v

15

A

B

C

D

E

F

G

H

r

A

r

B

r

C

r

D

r

E

r

F

r

G

r

H

S

(0.2)

(1.0)

(0.85)

(0.8)

(0.0)

(0.15)

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Conversion Algorithm (Example)

Automata Concatenations/State Merges – Shipment Process

A

1

A

2

A

₃

A

4

A

5

A

6

A

7

A

8

v

1

v

2

v

2

v

2

v

2

v

2

v

3

v

3

v

4

v

4

v

4

v

41

v

42

v

5

v

5

v

6

v

6

v

6

v

6

v

61

v

61

v

6¬1

v

62

v

62

v

6¬2

v

7

v

9

v

8

v

9

v

10

v

13

r

v3

r

v5

s

11

s

12

s

21

s

22

s

31

s

32

s

41

s

42

s

43

s

51

s

52

s

53

s

61

s

62

s

63

s

71

s

72

s

73

s

74

s

81

s

82

s

83

s

84

A

C

r

A

r

C

S

(0.2)

(1.0)

(0.85)

(0.8)

(0.0)

(0.15)

· · ·

A

0

_{= A}

₁

A

′

v

1

S

v

2

Automata Concatenations/State Merges – Shipment Process

A

1

A

2

A

₃

A

4

A

5

A

6

A

7

A

8

v

1

v

2

v

2

v

2

v

2

v

2

v

3

v

3

v

4

v

4

v

4

v

41

v

42

v

5

v

5

v

6

v

6

v

6

v

6

v

61

v

61

v

6¬1

v

62

v

62

v

6¬2

v

7

v

9

v

8

v

9

v

10

v

13

r

v3

r

v5

s

11

s

12

s

21

s

22

s

31

s

32

s

41

s

42

s

43

s

51

s

52

s

53

s

61

s

62

s

63

s

71

s

72

s

73

s

74

s

81

s

82

s

83

s

84

A

C

r

A

r

C

S

(0.2)

(1.0)

(0.85)

(0.8)

(0.0)

(0.15)

· · ·

A

0

_{= A}

₁

s

12

s

21

A

2

A

′

v

1

S

v

2

v

2

v

3

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Conversion Algorithm (Example)

Automata Concatenations/State Merges – Shipment Process

A

1

A

2

A

₃

A

4

A

5

A

6

A

7

A

8

v

1

v

2

v

2

v

2

v

2

v

2

v

3

v

3

v

4

v

4

v

4

v

41

v

42

v

5

v

5

v

6

v

6

v

6

v

6

v

61

v

61

v

6¬1

v

62

v

62

v

6¬2

v

7

v

9

v

8

v

9

v

10

v

13

r

v3

r

v5

s

11

s

12

s

21

s

22

s

31

s

32

s

41

s

42

s

43

s

51

s

52

s

53

s

61

s

62

s

63

s

71

s

72

s

73

s

74

s

81

s

82

s

83

s

84

A

C

r

A

r

C

S

(0.2)

(1.0)

(0.85)

(0.8)

(0.0)

(0.15)

· · ·

A

0

_{= A}

₁

s

12

s

21

A

2

s

₂₂

s

41

A

4

A

′

v

1

S

v

2

v

2

v

3

r

A

r

v3

A

v

4

Automata Concatenations/State Merges – Shipment Process

A

1

A

2

A

₃

A

4

A

5

A

6

A

7

A

8

v

1

v

2

v

2

v

2

v

2

v

2

v

3

v

3

v

4

v

4

v

4

v

41

v

42

v

5

v

5

v

6

v

6

v

6

v

6

v

61

v

61

v

6¬1

v

62

v

62

v

6¬2

v

7

v

9

v

8

v

9

v

10

v

13

r

v3

r

v5

s

11

s

12

s

21

s

22

s

31

s

32

s

41

s

42

s

43

s

51

s

52

s

53

s

61

s

62

s

63

s

71

s

72

s

73

s

74

s

81

s

82

s

83

s

84

A

C

r

A

r

C

S

(0.2)

(1.0)

(0.85)

(0.8)

(0.0)

(0.15)

· · ·

A

0

_{= A}

₁

s

12

s

21

A

2

s

₂₂

s

41

A

4

s

₄₃

s

51

A

5

A′ v1 v2 v2 v3 v4 v₄₁ v₄₂ r_v3 v5 v10 A rA S (0.85) (0.15)

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Conversion Algorithm (Example)

Automata Concatenations/State Merges – Shipment Process

A

0

_{= A}

₁

s

12

s

₂₁

A

2

s

₂₂

s

₄₁

A

4

s

₄₃

s

₅₁

A

5

s

₅₂

s

₆₁

A

6

s

₆₃

s

₇₁

A

7

s

₇₄

s

₉₁

A

9

s

₇₃

s

₁₁₁

A

11

A′ v1 v2 v2 v3 v4v41 v₄₂ r_v3 v5 v6 v6 v₆₁v61 v_6¬1 v7 v9 v9 v10 r_v5 r_v7 A C D rA rC r_D S (0.2) (0.85) (0.8) (0.15)

Automata Concatenations/State Merges – Shipment Process

A

0

₌

_(A

₁

s

12

s

₂₁

A

2

s

₂₂

s

₄₁

A

4

s

₄₃

s

₅₁

A

5

s

₅₂

s

₆₁

A

6

s

₆₃

s

₇₁

A

7

s

₇₄

s

₉₁

A

9

s

₇₃

s

₁₁₁

A

11

)

[s

7

4

B s

11

3

]

A′ v1 v2 v2 _v 3 v4v41 v₄₂ r_v3 v5 v6 v6 v61v61 v_6¬1 v7 v9 v10 r_v5 r_v7 A C D rA rC r_D S (0.2) (0.85) (0.8) (0.15)

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Conversion Algorithm (Example)

Automata Concatenations/State Merges – Shipment Process

A

0

₌

_(((A

₁

s

12

s

₂₁

A

2

s

₂₂

s

₄₁

A

4

s

₄₃

s

₅₁

A

5

s

₅₂

s

₆₁

A

6

s

₆₃

s

₇₁

A

7

s

₇₄

s

₉₁

A

9

s

₇₃

s

₁₁₁

A

11

)

[s

7

4

B s

11

3

]

s

₅₃

s

₁₃₁

A

13

s

₁₃₃

s

₁₄₁

A

14

)[s

9

2

B s

14

3

]

s

₉₂

s

₁₅₁

A

15

s

₁₅₂

s

₁₇₁

A

17

s

₁₇₂

s

₁₉₁

A

19

)[s

9

2

I]

A′ v1 v2 v2 v3 v4v41 v₄₂ v5 v6 v6 v61v61 v_6¬1 v7 v9 v9 v10 v11 v14 v14 v15 v16 r_v3 r_v5 r_v7 r_v10 r_v11 r_v15 A C D F G H rA rC rD rF rG rH S (0.2) (0.85) (0.8) (0.15)

Automata Concatenations/State Merges – Shipment Process

A

0

₌

_(((A

₁

s

12

s

₂₁

A

2

s

₂₂

s

₄₁

A

4

s

₄₃

s

₅₁

A

5

s

₅₂

s

₆₁

A

6

s

₆₃

s

₇₁

A

7

s

₇₄

s

₉₁

A

9

s

₇₃

s

₁₁₁

A

11

)

[s

7

4

B s

11

3

]

s

₅₃

s

₁₃₁

A

13

s

₁₃₃

s

₁₄₁

A

14

)[s

9

2

B s

14

3

]

s

₉₂

s

₁₅₁

A

15

s

₁₅₂

s

₁₇₁

A

17

s

₁₇₂

s

₁₉₁

A

19

)[s

9

2

I][s

1

1

B s

19

3

]

A′ v1 v2 v2 v3 v4v41 v₄₂ v5 v6 v6 v61v61 v_6¬1 v7 v9 v9 v10 v11 v14 v14 v15 r_v3 r_v5 r_v7 r_v10 r_v11 r_v15 A C D F G H rA rC rD rF rG rH S (0.2) (0.85) (0.8) (0.15)

Performance Evaluation of Business Processes through a Formal Transformation to SAN Automated Conversion from Business Process Models to SAN

Conversion Algorithm (Example)

Automata Concatenations/State Merges – Shipment Process

v1 v2 _v 3 v4 v5 v6 v7 v8 v9 v10 v11 v12 v13 v14 v15 v16 A B C D E F G H S T 0.85 0.15 0.2 1.0 Average Time Rate A 05 min 0.200 B 30 min 0.033 C 10 min 0.100 D 30 min 0.033 E 05 min 0.200 F 40 min 0.025 G 15 min 0.066 H 20 min 0.050 A′ A′′ A′′′ v1 v2 v2 v2 v2 v3 v4v41 v₄₂ v5 v6 v6 v6 v6 v61v61 v_6¬1 v₆₂v62 v_6¬2 v7 v8 v9 v9 v9 v9 v10 v11 v13 v14 v14 v14 v14 v15 r_v3 r_v5 r_v7 r_v8 r_v10 r_v11 r_v13 r_v15 A B C D E F G H r_A rB r_C rD rE rF rG rH S (0.2) (1.0) (0.85) (0.8) (0.0) (0.15)

Analysis of the SAN Model of the Shipment Process

Solving tool: PEPS

1

Parallel process instances

_⇒

automata replicas

Disabling of tasks in the case of unavailability of resources

_⇒

functional rates

Parallel

State

Reachable

Response

Utiliz.

Utiliz.

Utiliz.

Instanc.

Space

Space

Time (h)

Manager

Clerk

Worker

1

380

85

1.106

0.052

0.269

0.518

2

144,400

5,809

1.599

0.080

0.412

0.793

3

54,872,000

349,013

2.228

0.093

0.476

0.916

Performance Evaluation of Business Processes through a Formal Transformation to SAN Conclusion

Contributions and Discussion

Automated conversion of BP models to SAN models

Abstraction of the complexity involved in stochastic modeling

Ability to deal with large scale models

Software tool: BP2SAN

(http://www.ime.usp.br/~kellyrb/bp2san)

Missing: Resource Management Info

BP models lack information about resources:

What are the resources required in the business process?

How many are available?

What is their work capacity?

How are they accessed?

Extensions of the Work

Modeling Resource Management of Business Processes

Create Business Process Model Gather Quantitative Aspects business process Create Stochastic Models Analyze Numerically Integrate Results set of SAN models performance indices numerical results BPMN model annotated model of process + resources

Performance Evaluation of Business Processes through a Formal Transformation to SAN Conclusion

Other Related Works

Related Publications

K. R. Braghetto, J. E. Ferreira, J.-M. Vincent

“Performance Evaluation of Resource-Aware Business Processes Using

Stochastic Automata Networks”

International Journal of Innovative Computing, Information and Control (IJICIC),

special issue on Intelligent and Innovative Computing in Business Process

Management (IICBPM), 2011.

K. R. Braghetto, J. E. Ferreira, J.-M. Vincent

“Performance Analysis Modeling Applied to Business Processes”

Symposium on Theory of Modeling & Simulation – DEVS Integrative M & S

Symposium (DEVS’10)

I thank you for your attention

Create Business Process Model Gather Quantitative Aspects business process Create Stochastic Models Analyze Numerically Integrate Results set of SAN models performance indices numerical results BPMN model annotated model of process + resources