There and back again. On the reconstructability and rediscoverability of typed Jackson nets

DOI10.1007/978-3-031-33620-1_3zbMATH Open1541.68238MaRDI QIDQ6535182FDOQ6535182

Authors: Daniël Barenholz, Marco Montali, Artem Polyvyanyy, Hajo A. Reijers, Andrey Rivkin, Jan Martijn E. M. van der Werf 

Publication date: 16 November 2023

Recommendations

• Discovering block-structured process models from event logs -- a constructive approach
• Process discovery and Petri nets
• Discovering Petri nets from event logs
• Process model discovery: a method based on transition system decomposition
• Process discovery using integer linear programming

Mathematics Subject Classification ID

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

Cites Work

• Soundness of workflow nets: classification, decidability, and analysis
• Verification of workflow nets
• Discovering block-structured process models from event logs -- a constructive approach
• The box algebra = Petri nets + process expressions
• Discovering object-centric Petri nets
• Data and process resonance. Identifier soundness for models of information systems
• Describing Behavior of Processes with Many-to-Many Interactions
• Object-Centric Process Mining: Dealing with Divergence and Convergence in Event Data

This page was built for publication: There and back again. On the reconstructability and rediscoverability of typed Jackson nets

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