{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T20:56:43Z","timestamp":1770411403602,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642038471","type":"print"},{"value":"9783642038488","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03848-8_22","type":"book-chapter","created":{"date-parts":[[2009,8,25]],"date-time":"2009-08-25T23:31:50Z","timestamp":1251243110000},"page":"327-343","source":"Crossref","is-referenced-by-count":22,"title":["Divide-and-Conquer Strategies for Process Mining"],"prefix":"10.1007","author":[{"given":"Josep","family":"Carmona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Cortadella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kishinevsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Process mining, http:\/\/www.processmining.org"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-59293-8_207","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"E. Badouel","year":"1995","unstructured":"Badouel, E., Bernardinello, L., Darondeau, P.: Polynomial algorithms for the synthesis of bounded nets. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol.\u00a0915, pp. 364\u2013383. Springer, Heidelberg (1995)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Process mining based on regions of languages. In: Proc. 5th Int. Conf. on Business Process Management, September 2007, pp. 375\u2013383 (2007)","DOI":"10.1007\/978-3-540-75183-0_27"},{"key":"22_CR4","unstructured":"Carmona, J., Cortadella, J., Kishinevsky, M.: Divide-and-conquer strategies for process mining. Technical Report LSI-08-35-R, Software Department, Universitat Polit\u00e9cnica de Catalunya (2008)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-85758-7_26","volume-title":"Business Process Management","author":"J. Carmona","year":"2008","unstructured":"Carmona, J., Cortadella, J., Kishinevsky, M.: A region-based algorithm for discovering Petri nets from event logs. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol.\u00a05240, pp. 358\u2013373. Springer, Heidelberg (2008)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Carmona, J., Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: A symbolic algorithm for the synthesis of bounded Petri nets. In: 29th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (June 2008)","DOI":"10.1007\/978-3-540-68746-7_10"},{"issue":"8","key":"22_CR7","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/12.707587","volume":"47","author":"J. Cortadella","year":"1998","unstructured":"Cortadella, J., Kishinevsky, M., Lavagno, L., Yakovlev, A.: Deriving Petri nets from finite transition systems. IEEE Transactions on Computers\u00a047(8), 859\u2013882 (1998)","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139086547","volume-title":"Eigenspaces of Graphs","author":"D. Cvetkovi\u0107","year":"1997","unstructured":"Cvetkovi\u0107, D., Rowlinson, P., Simi\u0107, S.: Eigenspaces of Graphs. Cambridge University Press, Cambridge (1997)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-78238-4_4","volume-title":"Business Process Management Workshops","author":"A.K.A. Medeiros de","year":"2008","unstructured":"de Medeiros, A.K.A., Guzzo, A., Greco, G., van der Aalst, W.M.P., Weijters, A.J.M.M.T., van Dongen, B.F., Sacc\u00e0, D.: Process mining based on clustering: A quest for precision. In: ter Hofstede, A.H.M., Benatallah, B., Paik, H.-Y. (eds.) BPM Workshops 2007. LNCS, vol.\u00a04928, pp. 17\u201329. Springer, Heidelberg (2008)"},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s002360050046","volume":"33","author":"J. Desel","year":"1996","unstructured":"Desel, J., Reisig, W.: The synthesis problem of Petri nets. Acta Inf.\u00a033(4), 297\u2013315 (1996)","journal-title":"Acta Inf."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00264611","volume":"27","author":"A. Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures. Part I, II. Acta Informatica\u00a027, 315\u2013368 (1990)","journal-title":"Acta Informatica"},{"key":"22_CR12","first-page":"175","volume-title":"DAC 1982: Proceedings of the 19th conference on Design automation","author":"C.M. Fiduccia","year":"1982","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: DAC 1982: Proceedings of the 19th conference on Design automation, Piscataway, NJ, USA, 1982, pp. 175\u2013181. IEEE Computer Society Press, Los Alamitos (1982)"},{"key":"22_CR13","unstructured":"Hack, M.: Analysis of production schemata by Petri nets. M.s. thesis, MIT (Feburary 1972)"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell system technical journal\u00a049(1), 291\u2013307 (1970)","journal-title":"The Bell system technical journal"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Murata, T.: Petri Nets: Properties, analysis and applications. Proceedings of the IEEE, 541\u2013580 (April 1989)","DOI":"10.1109\/5.24143"},{"key":"22_CR16","unstructured":"Pretorius, A.J.: Visualization of State Transition Graphs. PhD thesis, Technical University of Eindhoven (2008)"},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.is.2007.07.001","volume":"33","author":"A. Rozinat","year":"2008","unstructured":"Rozinat, A., van der Aalst, W.M.P.: Conformance checking of processes based on monitoring real behavior. Inf. Syst.\u00a033(1), 64\u201395 (2008)","journal-title":"Inf. Syst."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P., Rubin, V., Verbeek, H., van Dongen, B., Kindler, E., G\u00fcnther, C.: Process mining: A two-step approach to balance between underfitting and overfitting. Technical Report BPM-08-01, BPM Center (2008)","DOI":"10.1007\/s10270-008-0106-z"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-73094-1_28","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"W.M.P. Aalst van der","year":"2007","unstructured":"van der Aalst, W.M.P., van Dongen, B.F., G\u00fcnther, C.W., Mans, R.S., de Medeiros, A.K.A., Rozinat, A., Rubin, V., Song, M., Verbeek, H.M.W(E.), Weijters, A.J.M.M.T.: ProM 4.0: Comprehensive support for real process analysis. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol.\u00a04546, pp. 484\u2013494. Springer, Heidelberg (2007)"},{"issue":"9","key":"22_CR20","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TKDE.2004.47","volume":"16","author":"W.M.P. Aalst van der","year":"2004","unstructured":"van der Aalst, W.M.P., Weijters, T., Maruster, L.: Workflow mining: Discovering process models from event logs. IEEE Trans. Knowl. Data Eng.\u00a016(9), 1128\u20131142 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-540-68746-7_24","volume-title":"Applications and Theory of Petri Nets","author":"J.M.E.M. Werf van der","year":"2008","unstructured":"van der Werf, J.M.E.M., van Dongen, B.F., Hurkens, C.A.J., Serebrenik, A.: Process discovery using integer linear programming. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol.\u00a05062, pp. 368\u2013387. Springer, Heidelberg (2008)"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55767-9","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","author":"W. Vogler","year":"1992","unstructured":"Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol.\u00a0625. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Business Process Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03848-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:10:16Z","timestamp":1558487416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03848-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038471","9783642038488"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03848-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}