Aggregating causal runs into workflow nets
DOI10.1007/978-3-642-35179-2_14zbMATH Open1377.68154OpenAlexW2128947279WikidataQ57004999 ScholiaQ57004999MaRDI QIDQ4909355FDOQ4909355
Jörg Desel, W. M. P. van der Aalst, Boudewijn van Dongen
Publication date: 13 March 2013
Published in: Transactions on Petri Nets and Other Models of Concurrency VI (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35179-2_14
Recommendations
Theory of organizations, manpower planning in operations research (90B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Process Mining
- Soundness of workflow nets: classification, decidability, and analysis
- Title not available (Why is that?)
- Formal Methods in Software and Systems Modeling
- The synthesis problem of Petri nets
- Synthesis of Petri nets from finite partial languages
- Partial (set) 2-structures. I: Basic notions and the representation problems
- Towards Synthesis of Petri Nets from Scenarios
- Process Discovery using Integer Linear Programming
- Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
- Applications and Theory of Petri Nets 2005
Cited In (4)
This page was built for publication: Aggregating causal runs into workflow nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909355)