Deklaratiivsete protsessimudelite avastamine sündmuste logist kasutades temporaalloogika päringuid
Files
Date
2014
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Käesolev magistritöö keskendub protsessile seatud piirangute avastamisele sündmuste logist, mida saab väljendada temporaalloogika abil. Piirangute avastamise meetodina kasutame temporaalloogika päringute kontrollimist sündmuste logi vastu. Temporaalloogika päring on modaalloogika avaldis, mis sisaldab muutujaid, mis võtavad oma väärtuse automaarpropositsioonide hulgast. Temporaalloogika päring käivitatakse vastu olekumasinat, mis on konstrueeritud sündmuste logi järgi. Päringu tulemuseks on kõik temporaalloogika avaldised, kus muutujad on asendatud kõikvõimalike automaarpropositsioonidega, mis muudavad avaldise tõeseks antud olekumasinas. See meetod ei vaja protsessi piirangute avastamiseks negatiivseid näiteid (protsessi juhtumid, mis ei tohi aset leida) sündmuste logis nagu osa avaldatuid meetodeid vajab. See meetod samuti laiendab võimalike avastatavate piirangute hulka võrreldes olemas olevate meetoditega.
This thesis will focus on the discovery of temporal logic constraints from an event log. The constraints are the description of the behavior of a business process. We will use Temporal Logic Query Checking for this purpose. A temporal logic query is a type of modal logic expression containing one or more placeholders that are checked against a transition system. The transition system is built from an event log. The result lists all possible activities that can replace the placeholders to satisfy the constraints described by the query in the log. This approach does not require (as many other approaches in the literature) negative examples as (additional) input and it provides the possibility of discovering a wider range of constraints to describe the process with respect to the existing approaches.
This thesis will focus on the discovery of temporal logic constraints from an event log. The constraints are the description of the behavior of a business process. We will use Temporal Logic Query Checking for this purpose. A temporal logic query is a type of modal logic expression containing one or more placeholders that are checked against a transition system. The transition system is built from an event log. The result lists all possible activities that can replace the placeholders to satisfy the constraints described by the query in the log. This approach does not require (as many other approaches in the literature) negative examples as (additional) input and it provides the possibility of discovering a wider range of constraints to describe the process with respect to the existing approaches.