Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Efficient Comparison of Process Models using Tabu Search Algorithm

Efficient Comparison of Process Models using Tabu Search Algorithm

MACSPro'2019 - Modeling and Analysis of Complex Systems and Processes, Vienna
21 - 23 March 2019

Andrey Skobtsov, Anna Kalenkova

Conference website http://macspro.club/

Website https://exactpro.com/
Linkedin https://www.linkedin.com/company/exactpro-systems-llc
Instagram https://www.instagram.com/exactpro/
Twitter https://twitter.com/exactpro
Facebook https://www.facebook.com/exactpro/
Youtube Channel https://www.youtube.com/c/exactprosystems

Exactpro
PRO

March 23, 2019
Tweet

More Decks by Exactpro

Other Decks in Research

Transcript

  1. Efficient Comparison of Process Models using Tabu Search
    Algorithm
    A.V. Skobtsov, A.A.Kalenkova
    23.03.2019

    View Slide

  2. Process mining
    Process
    ISO 9000:2005
    “Set of interrelated or interacting
    activities which transforms
    inputs into outputs”
    Mining

    View Slide

  3. Process mining
    The number of information
    systems around us is constantly
    growing…
    We don't always know how they
    are actually used:
     What actions are most often
    performed?
     In what order?
     Are there bottlenecks?
     How far we are from the expected
    behavior of the system.

    View Slide

  4. Process mining
    The number of information
    systems around us is constantly
    growing…
    We don't always know how they
    are actually used:
     What actions are most often
    performed?
     In what order?
     Are there bottlenecks?
     How far we are from the expected
    behavior of the system.

    View Slide

  5. Process mining
    User interaction:
     Internet marketing;
     E-government services;
     …
    Complex multi-component systems
    (software process mining)

    View Slide

  6. Process mining
    a
    a
    a
    a
    a
    a
    b
    b
    b
    b
    b
    b
    b
    b
    c
    c
    c
    c
    c
    c
    c
    d
    d d d
    d
    d
    d
    d
    d
    e
    e
    e
    e
    e
    e
    e
    e
    a b
    b
    a
    a b
    c
    Process-Aware
    Information Systems
    Industry
    a
    b
    c
    d
    f
    e
    Discovery
    • Discovery

    View Slide

  7. Process mining
    a
    a
    a
    a
    a
    a
    b
    b
    b
    b
    b
    b
    b
    b
    c
    c
    c
    c
    c
    c
    c
    d
    d d d
    d
    d
    d
    d
    d
    e
    e
    e
    e
    e
    e
    e
    e
    a b
    b
    a
    a b
    c
    Process-Aware
    Information Systems
    Industry
    a
    b
    c
    d
    f
    e
    Enhancement
    • Enhancement

    View Slide

  8. Process mining
    a
    a
    a
    a
    a
    a
    b
    b
    b
    b
    b
    b
    b
    b
    c
    c
    c
    c
    c
    c
    c
    d
    d d d
    d
    d
    d
    d
    d
    e
    e
    e
    e
    e
    e
    e
    e
    a b
    b
    a
    a b
    c
    Process-Aware
    Information Systems
    Industry
    a
    b
    c
    d
    f
    e
    Discovery
    Conformance
    checking
    Enhancement
    • Conformance
    checking

    View Slide

  9. Process mining. Conformance checking
    L2L – Comparison of event structures
    L2M – Replay techniques
    M2M - Must be something visual?

    View Slide

  10. Finding Minimal Graph Edit Distance
    register
    sign in
    fill the
    form
    select
    payment type
    pay
    register
    sign in
    fill the
    form

    View Slide

  11. A* Algorithm
    register
    sign in
    fill the
    form
    select
    payment type
    pay
    register
    sign in
    fill the
    form
    cost=0
    register
    sign in
    fill the
    form
    select
    payment type
    pay
    register
    sign in
    fill the
    form
    cost=0
    register
    sign in
    fill the
    form
    select
    payment type
    pay
    register
    sign in
    fill the
    form
    cost=10
    (Levenshtein
    distance)

    register register

    View Slide

  12. register
    sign in
    fill the
    form
    select
    payment type
    pay
    register
    sign in
    fill the
    form
    cost=13
    (Levenshtein
    distance)
    register
    sign in
    fill the
    form
    select
    payment type
    pay
    register
    sign in
    fill the
    form
    cost=10
    (deletion
    cost)

    register
    sign in
    fill the
    form
    select
    payment type
    pay
    register
    sign in
    fill the
    form
    cost=0
    A* Algorithm

    View Slide


  13. register
    sign in
    fill the
    form
    select
    payment type
    pay
    register
    sign in
    fill the
    form
    cost=10
    (Levenshtein
    Distance)
    register
    sign in
    fill the
    form
    select
    payment type
    pay
    register
    sign in
    fill the
    form
    cost=10
    (Deletion
    cost)


    … … …
    NP problem
    A* Algorithm

    View Slide

  14. Greedy algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions

    View Slide

  15. Greedy algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions

    View Slide

  16. Greedy algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions

    View Slide

  17. Greedy algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions

    View Slide

  18. Greedy algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions

    View Slide

  19. Greedy algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions

    View Slide

  20. Greedy algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions

    View Slide

  21. Greedy algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions

    View Slide

  22. Greedy algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions

    View Slide

  23. Tabu search algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions
    x
    Tabu list =

    View Slide

  24. Tabu search algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions
    x
    Tabu list =
    y

    View Slide

  25. Tabu search algorithm
    ...
    ...
    ... ...
    .
    .
    .
    .
    . .
    . .
    . .
    . .
    .
    .
    Possible solutions
    x
    Tabu list =
    y
    z

    View Slide

  26. BPMNDiffViz Tool
    https://pais.hse.ru/research/projects/CompBPMN

    View Slide

  27. Experimental results. BPMN models discovered
    from artificial event logs (different algorithms)

    View Slide

  28. Experimental results. BPMN models discovered
    from real event logs (different algorithms)

    View Slide

  29. Experimental results. BPMN models discovered
    from real event logs (different parts of logs)

    View Slide

  30. Future work
    Industry
     New suboptimal
    methods
     New application fields
    Theory
     Compare with other
    conformance checking methods
     Formal languages
     Different discovery algorithms
    (different structure of process
    models)

    View Slide

  31. Thank you!

    View Slide