Incremental process mining

CEUR Workshop Proceedings

Volumn 827, Issue , 2010, Pages 175-190

  Solé, Marc ^a   Carmona, Josep ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

INCREMENTAL PROCESS; INTERNAL REPRESENTATION; REGION-BASED; SPACE REQUIREMENTS; THEORY OF REGIONS; TRANSITION SYSTEM;

ALGORITHMS; MEDICAL APPLICATIONS; MODEL CHECKING;

PETRI NETS;

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

References (19)

1. Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures. Part I, II. Acta Informatica 27 (1990) 315-368
2. van der Aalst, W.M.P., Weijters, T., Maruster, L.: Workow mining: Discovering process models from event logs. IEEE Trans. Knowl. Data Eng. 16(9) (2004) 1128-1142
3. Badouel, E., Bernardinello, L., Darondeau, P.: Polynomial algorithms for the synthesis of bounded nets. Lecture Notes in Computer Science 915 (1995) 364-383
4. Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: An event structure semantics for general petri nets. Theor. Comput. Sci. 153(1&2) (1996) 129-170
5. Desel, J., Reisig, W.: The synthesis problem of Petri nets. Acta Inf. 33(4) (1996) 297-315
6. Badouel, E., Darondeau, P.: Theory of regions. In Reisig, W., Rozenberg, G., eds.: Petri Nets. Volume 1491 of LNCS., Springer (1998) 529-586
7. Mukund, M.: Petri nets and step transition systems. Int. Journal of Foundations of Computer Science 3(4) (1992) 443-478
8. Darondeau, P.: Deriving unbounded petri nets from formal languages. In Sangiorgi, D., de Simone, R., eds.: CONCUR. Volume 1466 of Lecture Notes in Computer Science., Springer (1998) 533-548
9. Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of petri nets from finite partial languages. Fundam. Inform. 88(4) (2008) 437-468
10. Carmona, J., Cortadella, J., Kishinevsky, M.: New region-based algorithms for deriving bounded Petri nets. IEEE Transactions on Computers 59(3) (2009)
11. Caillaud, B.: Synet : A synthesizer of distributable bounded Petri-nets from finite automata. http://www.irisa.fr/s4/tools/synet/ (2002)
12. Cortadella, J., Kishinevsky, M., Lavagno, L., Yakovlev, A.: Deriving Petri nets from finite transition systems. IEEE Trans. on Computers 47(8) (1998) 859-882
13. Carmona, J., Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: A symbolic algorithm for the synthesis of bounded Petri nets. In: Application and Theory of Petri Nets and Other Models of Concurrency. (2008)
14. Solé, M., Carmona, J.: Process mining from a basis of state regions. In: Application and Theory of Petri Nets and other Models of Concurrency. LNCS, Springer (2010) 226-245
15. van der Aalst, W., Rubin, V., Verbeek, H., van Dongen, B., Kindler, E., Günther, C.: Process mining: a two-step approach to balance between underfitting and overfitting. Software and Systems Modeling (2009)
16. Dongen, B.F.V., Busi, N., Pinna, G.M., van der Aalst, W.: An iterative algorithm for applying the theory of regions in process mining. In: Proceedings of the Workshop on Formal Approaches to Business Processes and Web Services (FABPWS'07). (2007) 36-55
17. Murata, T.: Petri Nets: Properties, analysis and applications. Proceedings of the IEEE (April 1989) 541-580
18. Bernardinello, L., Michelis, G.D., Petruni, K., Vigna, S.: On the synchronic structure of transition systems. In Desel, J., ed.: Structures in Concurrency Theory, Proc. of the Int. Workshop on Structures in Concurrency Theory. (1995) 69-84
19. Kalman, D.: Basic null space calculations. The College Mathematics Journal 15(1) (1984) 42-47