Lucent process models and translucent event logs

DOI10.3233/FI-2019-1842MaRDI QIDQ5212024zbMATH OpenOpenAlexFDO

Authors W. M. P. van der Aalst

Publication date 24 January 2020

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2019-1842

zbMATH Keywords

lucent process modelsPetri netsprocess miningtranslucent event logs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Discovering block-structured process models from event logs -- a constructive approach
• From place nets to local process models
• Discovering Petri nets from event logs
• Process model discovery: a method based on transition system decomposition
• Markings in perpetual free-choice nets are fully characterized by their enabled transitions

Cited in

(3)

• Reduction using induced subnets to systematically prove properties for free-choice nets
• Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions
• Free-choice Nets with Home Clusters are Lucent

This page was built for publication: Lucent process models and translucent event logs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212024)