PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!
  • Sesja wygasła!
  • Sesja wygasła!
  • Sesja wygasła!
  • Sesja wygasła!
Tytuł artykułu

Discovery of Cancellation Regions within Process Mining Techniques

Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
Process mining is a relatively new field of computer science which deals with process discovery and analysis based on event logs. In this work we consider the problem of discovering workflow nets with cancellation regions from event logs. Cancellations occur in the majority of real-life event logs. In spite of huge amount of process mining techniques little has been done on cancellation regions discovery. We show that the state-based region algorithm gives labeled Petri nets with overcomplicated control flow structure for logs with cancellations. We propose a novel method to discover cancellation regions from the transition systems built on event logs and show the way to construct equivalent workflow net with reset arcs to simplify the control flow structure.
Wydawca
Rocznik
Strony
197--209
Opis fizyczny
Bibliogr. 11 poz., rys.
Twórcy
  • National Research University Higher School of Economics (HSE), Moscow, 101000, Russia
  • National Research University Higher School of Economics (HSE), Moscow, 101000, Russia
Bibliografia
  • [1] W.M.P. van der Aalst. Discovery, Conformance and Enhancement of Business Processes. Springer-Verlag, Berlin, 2011.
  • [2] W.M.P. van der Aalst. Discovery, Verification and Conformance of Workflows with Cancellation. In 4th International Conference, ICGT 2008, vol. 5214 of Lecture Notes in Computer Science, pp. 18-37, Springer, 2008.
  • [3] W.M.P. van der Aalst, V. Rubin, B.F. van Dongen, E. Kindler, and C.W. Günther. Process Mining: A Two-Step Approach using Transition Systems and Regions. BPM Center Report BPM-06-30, BPMcenter.org, 2006.
  • [4] W.M.P. van der Aalst and A.H.M. ter Hofstede. YAWL: Yet another workflow language. Information Systems, vol. 30(4), pp. 245-275, 2005.
  • [5] W.M.P. van der Aalst, K.M. van Hee, A.H.M. ter Hofstede, N. Sidorova, H.M.W. Verbeek, M. Voorhoeve, M.T. Wynn. Soundness of Workflow Nets with Reset Arcs. Transactions on Petri Nets and Other Models of Concurrency, vol. 3, pp. 50-70, 2005.
  • [6] J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Deriving Petri Nets from Finite Transition Systems. IEEE Transactions on Computers, vol. 47(8), pp. 859-882, 1998.
  • [7] J. Cortadella, M. Kishinevsky, L. Lavagno, and A.Yakovlev. Synthesizing Petri nets from state-based models. Technical Report RR 95/09 UPC/DAC, Universitat Politecnica de Catalunya, April 1995.
  • [8] B.F. van Dongen, A.K. Alves de Medeiros, H.M.W. Verbeek, A.J.M.M. Weijters, and W.M.P. van der Aalst. The ProM framework: A New Era in Process Mining Tool Support. In G. Ciardo and P. Darondeau editors, Application and Theory of Petri Nets, vol. 3536 of Lecture Notes in Computer Science, pp. 444-454, Springer, 2005.
  • [9] A.A. Kalenkova and I.A. Lomazova. Discovery of cancellation regions within process mining techniques. In CS&P’2013, volume 1032 of CEUR Workshop Proceedings, pp. 232-244, CEUR-WS.org, 2013.
  • [10] M. Nielsen, G. Rozenberg, and P.S. Thiagarajan. Elementary transition systems. Theoretical computer science, vol. 96, pp. 3-33, 1992.
  • [11] Object Management Group. Business Process Modeling Notation (BPMN) Version 2.0, OMG Final Adopted Specification. Object Management Group, 2011.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-323eddad-77b7-4459-8110-2950bee0d619
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.