New Region-Based Algorithms for Deriving Bounded Petri Nets

DOI10.1109/TC.2009.131zbMATH Open1368.68259WikidataQ56892020 ScholiaQ56892020MaRDI QIDQ5280804FDOQ5280804

Authors Josep Carmona, Jordi Cortadella, Mike Kishinevsky

Publication date 27 July 2017

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

Mathematics Subject Classification ID

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

Cited in

(12)

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

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)