Abstract is missing.
- Determining the Number of Trace Clusters: a Stability-based ApproachPieter De Koninck, Jochen De Weerdt. 1-15 [doi]
- Process Mining in IT Service Management: A Case StudyBorja Vázquez-Barreiros, David Chapela, Manuel Mucientes, Manuel Lama, Diego Berea. 16-30 [doi]
- Discovering Process Models from Incomplete Event Logs using Conjoint Occurrence ClassesTonatiuh Tapia-Flores, Edelma Rodríguez-Pérez, Ernesto López-Mellado. 31-46 [doi]
- Synthesis of Elementary Net Systems with Final ConfigurationsBenjamin Meis, Robin Bergenthum, Jörg Desel. 47-57 [doi]
- Synthesis of bounded Petri Nets from Prime Event Structures with Cutting ContextGabriel Juhás, Robert Lorenz 0001. 58-77 [doi]
- Transition Systems Reduction: Balancing between Precision and SimplicitySergey A. Shershakov, Anna Kalenkova, Irina A. Lomazova. 78-95 [doi]
- Computing Alignments with Constraint Programming: The Acyclic CaseMaría Teresa Gómez López, Diana Borrego, Josep Carmona, Rafael M. Gasca. 96-110 [doi]
- Properties of Plain, Pure, and Safe Petri Nets - with some Applications to Petri Net SynthesisKamila Barylska, Eike Best. 111-125 [doi]
- Security-Sensitive Tackling of Obstructed Workow ExecutionsJulius Holderer, Josep Carmona, Günter Müller. 126-137 [doi]
- Calculating the Number of Unique Paths in a Block-Structured Process ModelGert Janssenswillen, Benoît Depaire, Toon Jouck. 138-152 [doi]
- Identification of Timed Discrete Event Processes. Building Input-Output Petri Net ModelsEdelma Rodríguez-Pérez, Tonatiuh Tapia-Flores, Ernesto López-Mellado. 153-167 [doi]