Data Petri Nets meet Probabilistic Programming (Extended version)
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916290334031872 |
|---|---|
| author | Kuhn, Martin Grüger, Joscha Matheja, Christoph Rivkin, Andrey |
| author_facet | Kuhn, Martin Grüger, Joscha Matheja, Christoph Rivkin, Andrey |
| contents | Probabilistic programming (PP) is a programming paradigm that allows for writing statistical models like ordinary programs, performing simulations by running those programs, and analyzing and refining their statistical behavior using powerful inference engines. This paper takes a step towards leveraging PP for reasoning about data-aware processes. To this end, we present a systematic translation of Data Petri Nets (DPNs) into a model written in a PP language whose features are supported by most PP systems. We show that our translation is sound and provides statistical guarantees for simulating DPNs. Furthermore, we discuss how PP can be used for process mining tasks and report on a prototype implementation of our translation. We also discuss further analysis scenarios that could be easily approached based on the proposed translation and available PP tools. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_11883 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Data Petri Nets meet Probabilistic Programming (Extended version) Kuhn, Martin Grüger, Joscha Matheja, Christoph Rivkin, Andrey Programming Languages Artificial Intelligence Probabilistic programming (PP) is a programming paradigm that allows for writing statistical models like ordinary programs, performing simulations by running those programs, and analyzing and refining their statistical behavior using powerful inference engines. This paper takes a step towards leveraging PP for reasoning about data-aware processes. To this end, we present a systematic translation of Data Petri Nets (DPNs) into a model written in a PP language whose features are supported by most PP systems. We show that our translation is sound and provides statistical guarantees for simulating DPNs. Furthermore, we discuss how PP can be used for process mining tasks and report on a prototype implementation of our translation. We also discuss further analysis scenarios that could be easily approached based on the proposed translation and available PP tools. |
| title | Data Petri Nets meet Probabilistic Programming (Extended version) |
| topic | Programming Languages Artificial Intelligence |
| url | https://arxiv.org/abs/2406.11883 |