New Region-Based Algorithms for Deriving Bounded Petri Nets

DOI10.1109/TC.2009.131MaRDI QIDQ5280804zbMATH OpenWikidataFDO

Authors Josep Carmona, Jordi Cortadella, Mike Kishinevsky

Publication date 27 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2009.131

Mathematics Subject Classification ID

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

Cited in

(12)

• Process mining with token carried data
• Bounded choice-free Petri net synthesis: algorithmic issues
• Discovering stochastic process models by reduction and abstraction
• Petri Net Synthesis for Restricted Classes of Nets
• Process Mining Reloaded: Event Structures as a Unified Representation of Process Models and Event Logs
• Projection approaches to process mining using region-based techniques
• Discovering object-centric Petri nets
• Automated repair of process models with non-local constraints using state-based region theory
• Automated repair of process models using non-local constraints
• \(k\)-bounded Petri net synthesis from modal transition systems
• Process model discovery: a method based on transition system decomposition
• Generation of synchronizing state machines from a transition system: a region-based approach

This page was built for publication: New Region-Based Algorithms for Deriving Bounded Petri Nets

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