{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T22:28:10Z","timestamp":1748816890668,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642158797"},{"type":"electronic","value":"9783642158803"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15880-3_18","type":"book-chapter","created":{"date-parts":[[2010,8,17]],"date-time":"2010-08-17T14:08:53Z","timestamp":1282054133000},"page":"184-199","source":"Crossref","is-referenced-by-count":18,"title":["Process Mining Meets Abstract Interpretation"],"prefix":"10.1007","author":[{"given":"J.","family":"Carmona","sequence":"first","affiliation":[]},{"given":"J.","family":"Cortadella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"ALGLIB library, http:\/\/www.alglib.net"},{"key":"18_CR2","unstructured":"Example log, http:\/\/www.lsi.upc.edu\/jcarmona\/prodcons1000.tr"},{"key":"18_CR3","unstructured":"Process mining, http:\/\/www.processmining.org"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-75183-0_27","volume-title":"Business Process Management","author":"R. Bergenthum","year":"2007","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Process mining based on regions of languages. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol.\u00a04714, pp. 375\u2013383. Springer, Heidelberg (2007)"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TC.2009.131","volume":"59","author":"J. Carmona","year":"2009","unstructured":"Carmona, J., Cortadella, J., Kishinevsky, M.: New region-based algorithms for deriving bounded Petri nets. IEEE Transactions on Computers\u00a059(3), 371\u2013384 (2009)","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/11494744_12","volume-title":"Applications and Theory of Petri Nets 2005","author":"R. Claris\u00f3","year":"2005","unstructured":"Claris\u00f3, R., Rodr\u00edguez-Carbonell, E., Cortadella, J.: Derivation of non-structural invariants of petri nets using abstract interpretation. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol.\u00a03536, pp. 188\u2013207. Springer, Heidelberg (2005)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proc. of the 2nd Int. Symposium on Programming, Dunod, Paris, France, pp. 106\u2013130 (1976)","DOI":"10.1145\/390018.808314"},{"key":"18_CR8","first-page":"238","volume-title":"Proc. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"18_CR9","first-page":"84","volume-title":"Proc. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proc. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pp. 84\u201397. ACM Press, New York (1978)"},{"key":"18_CR10","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":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/978-3-642-02658-4_52","volume-title":"Computer Aided Verification","author":"B. Jeannet","year":"2009","unstructured":"Jeannet, B., Min\u00e9, A.: Apron: A library of numerical abstract domains for static analysis. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 661\u2013667. Springer, Heidelberg (2009)"},{"key":"18_CR12","volume-title":"Principal Component Analysis","author":"I.T. Jolliffe","year":"2002","unstructured":"Jolliffe, I.T.: Principal Component Analysis. Springer, Heidelberg (2002)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Min\u00e9, A.: The octagon abstract domain. In: Analysis, Slicing and Tranformation (in Working Conference on Reverse Engineering), pp. 310\u2013319. IEEE, IEEE CS Press (October 2001)","DOI":"10.1109\/WCRE.2001.957836"},{"key":"18_CR14","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"},{"issue":"1","key":"18_CR15","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":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/3-540-65306-6_19","volume-title":"Lectures on Petri Nets I: Basic Models","author":"M. Silva","year":"1998","unstructured":"Silva, M., Teruel, E., Colom, J.M.: Linear algebraic and linear programming techniques for the analysis of place or transition net systems. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 309\u2013373. Springer, Heidelberg (1998)"},{"key":"18_CR17","first-page":"3","volume-title":"ACSD","author":"W.M.P. Aalst van der","year":"2007","unstructured":"van der Aalst, W.M.P., G\u00fcnther, C.W.: Finding structure in unstructured processes: The case for process mining. In: Basten, T., Juh\u00e1s, G., Shukla, S.K. (eds.) ACSD, pp. 3\u201312. IEEE Computer Society, Los Alamitos (2007)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P., Rubin, V., Verbeek, H.M.W.E., van Dongen, B.F., Kindler, E., G\u00fcnther, C.W.: Process mining: a two-step approach to balance between underfitting and overfitting. In: Software and Systems Modeling (2009)","DOI":"10.1007\/s10270-008-0106-z"},{"issue":"9","key":"18_CR19","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":"18_CR20","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":"18_CR21","unstructured":"Weijters, A., van der Aalst, W., de Medeiros, A.A.: Process mining with the heuristics miner-algorithm. Technical Report WP 166, BETA Working Paper Series, Eindhoven University of Technology (2006)"},{"issue":"2","key":"18_CR22","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10618-007-0065-y","volume":"15","author":"L. Wen","year":"2007","unstructured":"Wen, L., van der Aalst, W.M.P., Wang, J., Sun, J.: Mining process models with non-free-choice constructs. Data Min. Knowl. Discov.\u00a015(2), 145\u2013180 (2007)","journal-title":"Data Min. Knowl. Discov."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15880-3_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T18:34:07Z","timestamp":1740422047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15880-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642158797","9783642158803"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15880-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}