Event log visualisation with conditional partial order graphs: From control flow to data

CEUR Workshop Proceedings

Volumn 1371, Issue January, 2015, Pages 16-30

  Mokhov, Andrey ^a   Carmona, Josep ^b  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; VISUALIZATION;

COMPACT REPRESENTATION; CONTROL FLOWS; DATA FLOW; EVENT LOGS; PARTIAL ORDER; PROCESS MINING; PROCESS MODELING;

FLOW GRAPHS;

EID: 84937703874     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. The Workcraft framework homepage. http://www.workcraft.org/, 2009.
2. The ProM framework homepage. http://www.promtools.org/, 2010.
3. Joos C. A. M. Buijs, Boudewijn F. van Dongen, and Wil M. P. van der Aalst. A genetic algorithm for discovering process trees. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2012, Brisbane, Australia, June 10-15, 2012, pages 1-8, 2012.
4. Josep Carmona, Jordi Cortadella, and Michael Kishinevsky. New region-based algorithms for deriving bounded Petri nets. IEEE Trans. Computers, 59(3):371-384, 2010.
5. Josep Carmona and Marc Solé. PMLAB: an scripting environment for process mining. In Proceedings of the BPM Demo Sessions 2014 Co-located with the 12th International Conference on Business Process Management (BPM 2014), Eindhoven, The Netherlands, September 10, 2014., pages 16-21, 2014.
6. Corinna Cortes and Vladimir Vapnik. Support-vector networks. Machine Learning, 20(3):273-297, 1995.
7. A. de Gennaro, P. Stankaitis, and A. Mokhov. A heuristic algorithm for deriving compact models of processor instruction sets. In International Conference on Application of Concurrency to System Design (ACSD), 2015.
8. G. de Micheli. Synthesis and Optimization of Digital Circuits. McGraw-Hill Higher Education, 1994.
9. Christian W. Günther and Wil M. P. van der Aalst. Fuzzy mining - adaptive process simplification based on multi-perspective metrics. In Gustavo Alonso, Peter Dadam, and Michael Rosemann, editors, BPM, volume 4714 of Lecture Notes in Computer Science, pages 328-343. Springer, 2007.
10. Stefan Haar, Christian Kern, and Stefan Schwoon. Computing the reveals relation in occurrence nets. Theor. Comput. Sci., 493:66-79, 2013.
11. Mark Hall, Eibe Frank, Geoffrey Holmes, Bernhard Pfahringer, Peter Reutemann, and Ian H Witten. The WEKA data mining software: an update. ACM SIGKDD explorations newsletter, 11(1):10-18, 2009.
12. Maikel Leemans and Wil M. P. van der Aalst. Discovery of frequent episodes in event logs. In Proceedings of the 4th International Symposium on Data-driven Process Discovery and Analysis (SIMPDA 2014), Milan, Italy, November 19-21, 2014., pages 31-45, 2014.
13. Sander J. J. Leemans, Dirk Fahland, and Wil M. P. van der Aalst. Discovering block-structured process models from event logs - A constructive approach. In Application and Theory of Petri Nets and Concurrency - 34th International Conference, PETRI NETS 2013, Milan, Italy, June 24-28, 2013. Proceedings, pages 311-329, 2013.
14. H. Ponce De Leon and A. Mokhov. Building bridges between sets of partial orders. In International Conference on Language and Automata Theory and Applications (LATA), 2015.
15. KL McMillan. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In Proceedings of Computer Aided Verification conference (CAV), volume 663, page 164, 1992.
16. Tom M. Mitchell. Machine learning. McGraw Hill series in computer science. McGraw-Hill, 1997.
17. A. Mokhov. Conditional Partial Order Graphs. PhD thesis, Newcastle University, 2009.
18. A. Mokhov, A. Alekseyev, and A. Yakovlev. Encoding of processor instruction sets with explicit concurrency control. Computers & Digital Techniques, IET, 5(6):427-439, 2011.
19. A. Mokhov and V. Khomenko. Algebra of Parameterised Graphs. ACM Transactions on Embedded Computing Systems (TECS), 13(4 s):143, 2014.
20. A. Mokhov and A. Yakovlev. Conditional Partial Order Graphs: Model, Synthesis, and Application. IEEE Transactions on Computers, 59(11):1480-1493, 2010.
21. M. Nielsen, G. D. Plotkin, and G. Winskel. Petri nets, event structures and domains, part I. Theoretical Computer Science, 13:85-108, 1981.
22. Ivan Poliakov, Danil Sokolov, and Andrey Mokhov. Workcraft: a static data flow structure editing, visualisation and analysis tool. In Petri Nets and Other Models of Concurrency-ICATPN 2007, pages 505-514. Springer, 2007.
23. J. Ross Quinlan. Induction of decision trees. Machine Learning, 1(1):81-106, 1986.
24. Marc Solé and Josep Carmona. Light region-based techniques for process discovery. Fundam. Inform., 113(3-4):343-376, 2011.
25. Minseok Song and Wil MP van der Aalst. Supporting process mining by showing events at a glance. Proceedings of the 17th Annual Workshop on Information Technologies and Systems (WITS), pages 139-145, 2007.
26. Wil van der Aalst. Process Mining: Discovery, Conformance and Enhancement of Business Processes. Springer, 2011.
27. Wil M. P. van der Aalst, Ton Weijters, and Laura Maruster. Workflow mining: Discovering process models from event logs. IEEE TKDE, 16(9):1128-1142, 2004.
28. Jan Martijn E. M. van der Werf, Boudewijn F. van Dongen, Cor A. J. Hurkens, and Alexander Serebrenik. Process discovery using integer linear programming. In ATPN, pages 368-387, 2008.
29. Tiziano Villa, Timothy Kam, Robert K Brayton, and Alberto L Sangiovanni-Vincentelli. Synthesis of finite state machines: logic optimization. Springer Publishing Company, Incorporated, 2012.
30. Ingo Wegener. The Complexity of Boolean Functions. Johann Wolfgang Goethe-Universitat, 1987.
31. A. J. M. M. Weijters, W. M. P. van der Aalst, and A. K. Alves de Medeiros. Process mining with the heuristics miner-algorithm. Technical Report WP 166, BETA Working Paper Series, Eindhoven University of Technology, 2006.