• Nie Znaleziono Wyników

Process Mining and Security: Process Mining and Security:

N/A
N/A
Protected

Academic year: 2021

Share "Process Mining and Security: Process Mining and Security:"

Copied!
17
0
0

Pełen tekst

(1)

/faculteit technologie management

Process Mining and Security:

Process Mining and Security:

Detecting Anomalous Process Executions Detecting Anomalous Process Executions

and Checking Process Conformance and Checking Process Conformance

Wil van der Aalst

Ana Karla A. de Medeiros

Eindhoven University of Technology Department of Information and Technology

a.k.medeiros@tm.tue.nl

(2)

/faculteit technologie management

Outline

• Motivation

• Process Mining: -algorithm

• Detecting Anomalous Process Execution

• Checking Process Conformance

• Conclusion and Future work

(3)

/faculteit technologie management

Process Mining:

Overview

1) basic

performance metrics

2) process model

Start

Register order

Prepare shipment

Ship goods (Re)send bill

Receive paym ent Contact

customer

Archive order

End

3) organizational model 4) social network

5) performance characteristics

If …then …

6) auditing/security

(4)

/faculteit technologie management

– Workflow Mining (What is the

process?)

– Delta analysis (Are we doing what was

specified?) – Performance

analysis (How can we improve?)

Motivation

(5)

/faculteit technologie management

Motivation

How can we benefit from process mining to How can we benefit from process mining to

verify security issues in computer verify security issues in computer

systems?

systems?

– Detect anomalous process execution

– Check process conformance

(6)

/faculteit technologie management

Process Mining – Process log

ABCD ABCD ACBD ACBD EF EF

case 1 : task A case 1 : task A case 2 : task A case 2 : task A case 3 : task A case 3 : task A case 3 : task B case 3 : task B case 1 : task B case 1 : task B case 1 : task C case 1 : task C case 2 : task C case 2 : task C case 4 : task A case 4 : task A case 2 : task B case 2 : task B case 2 : task D case 2 : task D case 5 : task E case 5 : task E case 4 : task C case 4 : task C case 1 : task D case 1 : task D case 3 : task C case 3 : task C case 3 : task D case 3 : task D case 4 : task B case 4 : task B case 5 : task F case 5 : task F case 4 : task D case 4 : task D

• Minimal information in noise- free log: case id’s and task id’s

• Additional information: event type, time, resources, and data

• In this log there are three

possible sequences:

(7)

/faculteit technologie management

Process Mining – Ordering Relations >,,||,#

• Direct succession:

x>y iff for some case x is directly followed by y.

• Causality: xy iff x>y and not y>x.

• Parallel: x||y iff x>y and y>x

• Unrelated: x#y iff not x>y and not y>x.

case 1 : task A case 1 : task A case 2 : task A case 2 : task A case 3 : task A case 3 : task A case 3 : task B case 3 : task B case 1 : task B case 1 : task B case 1 : task C case 1 : task C case 2 : task C case 2 : task C case 4 : task A case 4 : task A case 2 : task B case 2 : task B ......

A>B A>B A>C A>C B>C B>C B>D B>D C>B C>B C>D C>D E>F E>F

AA

 

BB AA

 

CC BB

 

DD CC

 

DD EE

 

FF B||CB||C

C||BC||B

ABCD ABCD

ACBD ACBD

EF EF

(8)

/faculteit technologie management

Process Mining –

-algorithm

Let W be a workflow log over T. (W) is defined as follows.

1. TW = { t  T    W t  },

2. TI = { t  T    W t = first() }, 3. TO = { t  T    W t = last() },

4. XW = { (A,B)  A  TW  B  TW  a  Ab  B a W b  a1,a2  A a1#W a2  b1,b2  B b1#W b2 },

5. YW = { (A,B)  X  (A,B)  XA  A B  B (A,B) = (A,B) }, 6. PW = { p(A,B)  (A,B)  YW } {iW,oW},

7. FW = { (a,p(A,B))  (A,B)  YW  a  A }  { (p(A,B),b)  (A,B)  YW  b

 B } { (iW,t)  t  TI} { (t,oW)  t  TO}, and 8. (W) = (PW,TW,FW).

(9)

/faculteit technologie management

Process Mining –

-algorithm

A

B

C

D

E F

ABCD ABCD ACBD ACBD EF EF

AA

 

BB AA

 

CC BB

 

DD CC

 

DD EE

 

FF B||CB||C

C||BC||B

(10)

/faculteit technologie management

Process Mining –

-algorithm

• If log is complete with respect to relation >, it can be used to mine SWF-net without short loops

• Structured Workflow Nets (SWF-nets) have no

implicit places and the following two constructs

cannot be used:

(11)

/faculteit technologie management

Detecting Anomalous Process Executions

• Use the -algorithm to discover the acceptable behavior

– Log traces = audit trails – Cases = session ids

– Complete log only has acceptable audit trails

• Verify the conformance of new audit trails by

playing the “token game”

(12)

/faculteit technologie management

Detecting Anomalous Process Executions

Enter, Select Product, Add to Basket, Cancel Order  

(13)

/faculteit technologie management

Detecting Anomalous Process Executions

Enter, Select Product, Add to Basket, Proceed to Checkout, Fill in Delivery Info, Fill in Payment Info,

Process Order, Finish Checkout  

(14)

/faculteit technologie management

• Verify if a pattern holds

Checking Process Conformance

Provide Password

 Process Order

So…

Provide Password > Process Order and

NOT Process Order > Provide Password

(15)

/faculteit technologie management

Provide Password  Process Order

Checking Process Conformance

(!) Token game can be used to verify if the pattern holds

for every audit trail

(16)

/faculteit technologie management

Conclusion

– Process mining can be used to

• Detect anomalous behavior

• Check process conformance

– Tools are available at our website www.processmining.org

www.processmining.org

Future Work

– Apply process mining to audit trails from real-life case studies

Conclusion and

Future Work

(17)

/faculteit technologie management

Questions?

www.processmining.org

www.processmining.org

Cytaty

Powiązane dokumenty

Als deze kosten lager zijn dan de gemiddelde kosten dan is er sprake van schaalvoordelen, door extra bezoeken nemen de gemiddelde kosten per bezoek steeds verder af (voor

The role of simulators and the qualifications of instructors and assessors under the STCW Convention M.LBarnett STCW 1995 redempfion or receivership CR.PilUmry 2 Manoeuvring

Keywords: Gaussian processes, regression, machine learning, optimization, system identification, automatic control, wind energy, smart rotor.. Printed by: Ridderprint

znalezisk pozornych mieszczą się: Ozyrys z jeziora Gopło (znaleziony przed 1852 r.), głowa Izydy z Kartuz (znaleziona przed 1882 r.), brązowa figurka Ozyrysa i uszebti

Our aim is to identify regions that (1) are located in drylands, (2) contain a high percent- age of rainfed cereal-grain agricultural land (growing maize, millet, and/or sorghum),

Nic w tym dziwnego, jeśli bowiem trudności jeńców niemieckich kończyły się zazwyczaj z chwilą przekroczenia granicy polsko-nie­ mieckiej, to dla dużej części byłych

Ten artykuł jest próbą dowiedzenia, że niektóre gatunki zwierząt posługują się ję- zykiem, a  także pretekstem do zastanowienia się, jak wiele gatunków

• Nauczyciel prosi uczniów o wylosowanie zestawu trzech reakcji językowych i odpowiedzenie na nie, np.: 1. Zapytaj koleżankę, co lubi robić. 2. Powiedz, że lubisz pływać. 3.