Download to read offline
![Declarative specification
Cecilia Iacometta and Claudio Di Ciccio
[Right] Dwyer, M. B., Avrunin, G. S., Corbett, J. C. (1999), “Patterns in property specifications for finite-state verification”
[Left] D.C., Montali, M. (2022) “Declarative Process Specifications: Reasoning, Discovery, Monitoring”](https://image.slidesharecdn.com/minerfuldemo-251015085315-c35d4376/85/Declarative-Process-Mining-with-MINERful-Reloaded-3-320.jpg)
![Declarative specification
Cecilia Iacometta and Claudio Di Ciccio
[Right] Dwyer, M. B., Avrunin, G. S., Corbett, J. C. (1999), “Patterns in property specifications for finite-state verification”
[Left] D.C., Montali, M. (2022) “Declarative Process Specifications: Reasoning, Discovery, Monitoring”](https://image.slidesharecdn.com/minerfuldemo-251015085315-c35d4376/75/Declarative-Process-Mining-with-MINERful-Reloaded-3-2048.jpg)
Uploaded byCecilia Iacometta
Declarative Process Mining with MINERful, Reloaded
Tool presentation for MINERful process mining, simulation, and analysis tool for declarative process specifications. Tool available on GitHub https://github.com/Process-in-Chains/MINERful
Declarative Process Mining with MINERful, Reloaded
- 1. Declarative process mining withMINERful Cecilia Iacometta | c.iacometta@students.uu.nl Claudio Di Ciccio | c.diciccio@uu.nl Utrecht University, Netherlands
- 2. Declarative specification • “Openmodel” • Specify constraints for permitted behaviour • Every execution that complies with them is acceptable Cecilia Iacometta and Claudio Di Ciccio Dwyer, M. B., Avrunin, G. S., Corbett, J. C. (1999), “Patterns in property specifications for finite-state verification”
- 3. Declarative specification Cecilia Iacomettaand Claudio Di Ciccio [Right] Dwyer, M. B., Avrunin, G. S., Corbett, J. C. (1999), “Patterns in property specifications for finite-state verification” [Left] D.C., Montali, M. (2022) “Declarative Process Specifications: Reasoning, Discovery, Monitoring”
- 4. DECLARE templates: Sepsis constraintsexamples Init(ER Registration) Every process instance starts with activity ER Registration <ER Triage, IV Antibiotics, Release A> <ER Registration, ER Triage, IV Antibiotics, Admission NC, Release A> ER Registration Init Cecilia Iacometta and Claudio Di Ciccio Precedence(IV Antibiotics, Admission NC) If Admission NC occurs, then IV Antibiotics has to occur before Admission NC <ER Registration, ER Triage, Admission NC, Release A> <ER Registration, ER Triage, IV Antibiotics, Admission NC, Release A> Admission NC IV Antibiotics Activation Target
- 5. Quality measures fordeclarative process mining Cecilia Iacometta and Claudio Di Ciccio • Support: number of satisfaction given the activations over the total number of events or traces • Confidence: number of satisfaction given the activations over the total number of activations • Coverage: number of activations over the total number of events or traces
- 6. MINERful functionalities Cecilia Iacomettaand Claudio Di Ciccio
- 7. MINERful functionalities Cecilia Iacomettaand Claudio Di Ciccio
- 8. MINERful functionalities Cecilia Iacomettaand Claudio Di Ciccio
- 9. MINERful functionalities Cecilia Iacomettaand Claudio Di Ciccio
- 10. MINERful functionalities Cecilia Iacomettaand Claudio Di Ciccio
- 11. How to runMINERful Cecilia Iacometta and Claudio Di Ciccio Tocreatesyntheticlogs:run−MINERfulEventLogMaker.sh To launch the miner:run−MINERful.sh Tosimplifyspecifications:run−MINERfulSimplifier.sh Tocheck thefitness:run−MINERfulFitnessChecker.sh Tolaunchthemineronsublogs:run−MINERfulSlider.sh
- 12. Cecilia Iacometta andClaudio Di Ciccio
- 13. Cecilia Iacometta andClaudio Di Ciccio
- 14. Cecilia Iacometta andClaudio Di Ciccio
- 15. Cecilia Iacometta andClaudio Di Ciccio
- 16. Cecilia Iacometta andClaudio Di Ciccio
- 17. Cecilia Iacometta andClaudio Di Ciccio
- 18. Declarative process mining withMINERful Cecilia Iacometta | c.iacometta@students.uu.nl Claudio Di Ciccio | c.diciccio@uu.nl Utrecht University, Netherlands
Editor's Notes
- #2 A declarative specification is an open model in which there are specified constraints for permitted behaviout and every execution compiying with these constraints is acceptable
- #3 declarative templates can be either existance and relation
- #4 We use DECLARE language which is a languange for linear temporal logic on finite traces with DECLARE templates we can represent existance and relation constraints Starting from Sepsis event log: a log in which the traces represent patients affected by hospedalisation process we can take as examples init patient registration ER registration and Precedence administering antibioticsIV antibiotics and admission to the normal care ward Admission NC First one Evert process instance, trace, srarts with ER regisytration If Adm NC activator occurs then IV ant has to occur before that
- #5 We can compute trace and event based quality measures for declarative process mining in particular confidence support and coverage Confidence for example is the total number of satissfaction given an activation over the total number of activations
- #11 The easiest way to launch MINERful is to make use of the .sh files.
- #12 The easiest way to launch MINERful is to make use of the .sh files.
- #13 The easiest way to launch MINERful is to make use of the .sh files.
- #14 The easiest way to launch MINERful is to make use of the .sh files.
- #15 The easiest way to launch MINERful is to make use of the .sh files.
- #16 The easiest way to launch MINERful is to make use of the .sh files.
- #17 The easiest way to launch MINERful is to make use of the .sh files.