| _version_ | 1866901727102369792 |
|---|---|
| author | Hense, Andreas |
| author_facet | Hense, Andreas |
| contents | <p>Can a rule-based, declarative approach capture flexible business processes more effectively than Petri nets?<br>This video introduces declarative process modeling and mining using the Declare language and the RuM tool, contrasting it with traditional imperative approaches based on Petri nets.</p> <p>Instead of prescribing strict execution sequences, declarative models specify constraints that define which behaviors are allowed or forbidden. The video explains the core concepts of Declare, including constraint types and their textual representation, and shows how these constraints are translated into finite automata. It further demonstrates how XES event logs can be generated from Declare models using RuM and compares the expressive power of declarative constraints with that of Petri net–based models.</p> <p>The example illustrates how declarative modeling supports flexibility in loosely structured processes while still enabling formal analysis and process mining.</p> <p>Related resources:<br>- Introduction to RuM:<br> https://youtu.be/buld2QQ1afg<br>- RuM download page:<br> https://rulemining.org<br>- Specification and Verification of Declarative Open Interaction Models:<br> https://link.springer.com/content/pdf/10.1007%2F978-3-642-14538-4.pdf</p> <p>This is video #26 of the BPASeries.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_20314492 |
| institution | Zenodo |
| language | |
| publishDate | 2022 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Discover Declarative Process Mining: How RuM Works Hense, Andreas <p>Can a rule-based, declarative approach capture flexible business processes more effectively than Petri nets?<br>This video introduces declarative process modeling and mining using the Declare language and the RuM tool, contrasting it with traditional imperative approaches based on Petri nets.</p> <p>Instead of prescribing strict execution sequences, declarative models specify constraints that define which behaviors are allowed or forbidden. The video explains the core concepts of Declare, including constraint types and their textual representation, and shows how these constraints are translated into finite automata. It further demonstrates how XES event logs can be generated from Declare models using RuM and compares the expressive power of declarative constraints with that of Petri net–based models.</p> <p>The example illustrates how declarative modeling supports flexibility in loosely structured processes while still enabling formal analysis and process mining.</p> <p>Related resources:<br>- Introduction to RuM:<br> https://youtu.be/buld2QQ1afg<br>- RuM download page:<br> https://rulemining.org<br>- Specification and Verification of Declarative Open Interaction Models:<br> https://link.springer.com/content/pdf/10.1007%2F978-3-642-14538-4.pdf</p> <p>This is video #26 of the BPASeries.</p> |
| title | Discover Declarative Process Mining: How RuM Works |
| url | https://doi.org/10.5281/zenodo.20314492 |