Discovering stochastic process models by reduction and abstraction

DOI10.1007/978-3-030-76983-3_16zbMath1489.68155OpenAlexW3157808921MaRDI QIDQ2117180

Sander J. J. Leemans, Adam Burke, Moe Thandar Wynn

Publication date: 21 March 2022

Full work available at URL: https://eprints.qut.edu.au/210044/1/burke_leemans_wynn_discovering_toothpaste_20210322.pdf

zbMATH Keywords

stochastic Petri netsprocess miningstochastic process discoverystochastic process mining

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
• Grammatical inference and applications. 2nd international colloquium, ICGI-94, Alicante, Spain, September 21-23, 1994. Proceedings
• The imprecisions of precision measures in process mining
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Accurate computation of the relative entropy between stochastic regular grammars
• Structural Reductions Revisited
• New Region-Based Algorithms for Deriving Bounded Petri Nets
• Discovering Block-Structured Process Models from Event Logs - A Constructive Approach
• A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains

This page was built for publication: Discovering stochastic process models by reduction and abstraction