{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T09:02:13Z","timestamp":1772960533917,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,12]],"date-time":"2011-06-12T00:00:00Z","timestamp":1307836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10618-011-0226-x","type":"journal-article","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T11:30:01Z","timestamp":1307791801000},"page":"218-246","source":"Crossref","is-referenced-by-count":23,"title":["Projection approaches to process mining using region-based techniques"],"prefix":"10.1007","volume":"24","author":[{"given":"Josep","family":"Carmona","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,12]]},"reference":[{"key":"226_CR1","volume-title":"Finite transition systems","author":"A Arnold","year":"1994","unstructured":"Arnold A (1994) Finite transition systems. Prentice Hall, Englewood Cliffs"},{"key":"226_CR2","doi-asserted-by":"crossref","unstructured":"Badouel E, Bernardinello L, Darondeau P (1995) Polynomial algorithms for the synthesis of bounded nets. In: Theory and practice of software (TAPSOFT). Lecture notes in computer science, vol 915. pp 364\u2013383","DOI":"10.1007\/3-540-59293-8_207"},{"key":"226_CR3","doi-asserted-by":"crossref","unstructured":"Bergenthum R, Desel J, Lorenz R, SMauser (2007) Process mining based on regions of languages. In: Proceedings of 5th international conference on business process management (BPM), pp 375\u2013383","DOI":"10.1007\/978-3-540-75183-0_27"},{"issue":"4","key":"226_CR4","first-page":"437","volume":"88","author":"R Bergenthum","year":"2008","unstructured":"Bergenthum R, Desel J, Lorenz R, Mauser S (2008) Synthesis of Petri nets from finite partial languages. Fundam Inform 88(4): 437\u2013468","journal-title":"Fundam Inform"},{"key":"226_CR5","unstructured":"Carmona J, Cortadella J, Kishinevsky M (2008a) Divide-and-conquer strategies for process mining. Tech. Rep. LSI-08-35-R, Software Department, Universitat Polit\u00e8cnica de Catalunya"},{"key":"226_CR6","doi-asserted-by":"crossref","unstructured":"Carmona J, Cortadella J, Kishinevsky M (2008b) A region-based algorithm for discovering Petri nets from event logs. In: Dumas M, Reichert M, Shan MC (eds) Proceedings of 6th international conference on business process management (BPM). Lecture notes in computer science, vol 5240. Springer, Berlin, pp 358\u2013373","DOI":"10.1007\/978-3-540-85758-7_26"},{"key":"226_CR7","doi-asserted-by":"crossref","unstructured":"Carmona J, Cortadella J, Kishinevsky M, Kondratyev A, Lavagno L, Yakovlev A (2008c) A symbolic algorithm for the synthesis of bounded Petri nets. In: van Hee KM, Valk R (eds) 29th international conference on application and theory of Petri nets and other models of concurrency, vol 5062.","DOI":"10.1007\/978-3-540-68746-7_10"},{"key":"226_CR8","doi-asserted-by":"crossref","unstructured":"Carmona J, Cortadella J, Kishinevsky M (2009) Divide-and-conquer strategies for process mining. In: Dayal U, Eder J, Koehler J, Reijers HA (eds) Proc. 7th international conference on business process management (BPM). Lecture notes in computer science, vol 5701. Springer, Heidelberg, pp 327\u2013343","DOI":"10.1007\/978-3-642-03848-8_22"},{"issue":"3","key":"226_CR9","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TC.2009.131","volume":"59","author":"J Carmona","year":"2009","unstructured":"Carmona J, Cortadella J, Kishinevsky M (2009) New region-based algorithms for deriving bounded Petri nets. IEEE Trans Comp 59(3): 371\u2013384. doi: 10.1109\/TC.2009.131","journal-title":"IEEE Trans Comp"},{"issue":"3","key":"226_CR10","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/287000.287001","volume":"7","author":"JE Cook","year":"1998","unstructured":"Cook JE, Wolf AL (1998) Discovering models of software processes from event-based data. ACM Trans Softw Eng Methodol 7(3): 215\u2013249","journal-title":"ACM Trans Softw Eng Methodol"},{"issue":"8","key":"226_CR11","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1109\/12.707587","volume":"47","author":"J Cortadella","year":"1998","unstructured":"Cortadella J, Kishinevsky M, Lavagno L, Yakovlev A (1998) Deriving Petri nets from finite transition systems. IEEE Trans Comput 47(8): 859\u2013882","journal-title":"IEEE Trans Comput"},{"key":"226_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139086547","volume-title":"Eigenspaces of graphs","author":"D Cvetkovi\u0107","year":"1997","unstructured":"Cvetkovi\u0107 D, Rowlinson P, Simi\u0107 S (1997) Eigenspaces of graphs. Cambridge University Press, Cambridge"},{"issue":"4","key":"226_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s002360050046","volume":"33","author":"J Desel","year":"1996","unstructured":"Desel J, Reisig W (1996) The synthesis problem of Petri nets. Acta Informatica 33(4): 297\u2013315","journal-title":"Acta Informatica"},{"key":"226_CR14","doi-asserted-by":"crossref","unstructured":"Dill D, Drexler A, Hu A, Yang C (1992) Protocol verification as a hardware design aid. In: Computer design: VLSI in computers and processors, 1992. ICCD \u201992. Proceedings. IEEE 1992 international conference, pp 522\u2013525","DOI":"10.1109\/ICCD.1992.276232"},{"key":"226_CR15","unstructured":"Dongen B, Busi N, Pinna G, van Der Aalst WMP (2007) An iterative algorithm for applying the theory of regions in process mining. In: Workshop on formal aspects of business processes and web services"},{"key":"226_CR16","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00264611","volume":"27","author":"A Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht A, Rozenberg G (1990) Partial (Set) 2-structures. Part I, II. Acta Informatica 27: 315\u2013368","journal-title":"Acta Informatica"},{"key":"226_CR17","unstructured":"Fiduccia CM, Mattheyses RM (1982) A linear-time heuristic for improving network partitions. In: Proceedings of the 19th conference on design automation (DAC \u201982). IEEE Press, Piscataway, pp 175\u2013181"},{"key":"226_CR18","doi-asserted-by":"crossref","unstructured":"Ghionna L, Greco G, Guzzo A, Pontieri L (2008) Outlier detection techniques for process mining applications. In: Foundations of intelligent systems, 17th international symposium, ISMIS 2008, Toronto, Canada, 20\u201323 May 2008. Proceedings. Lecture notes in computer science, vol 4994. Springer, Berlin, pp 150\u2013159","DOI":"10.1007\/978-3-540-68123-6_17"},{"issue":"8","key":"226_CR19","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/TKDE.2006.123","volume":"18","author":"G Greco","year":"2006","unstructured":"Greco G, Guzzo A, Pontieri L, Sacc\u00e0 D (2006) Discovering expressive process models by clustering log traces. IEEE Trans Knowl Data Eng 18(8): 1010\u20131027","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"226_CR20","unstructured":"G\u00fcnther C (2009) Process Mining in Flexible Environments. Dissertation, Technical University of Eindhoven, Eindhoven"},{"key":"226_CR21","unstructured":"Hack M (1972) Analysis of production schemata by Petri nets. M.S. thesis, MIT"},{"issue":"3","key":"226_CR22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D Harel","year":"1987","unstructured":"Harel D (1987) Statecharts: A visual formulation for complex systems. Sci Comput Program 8(3): 231\u2013274","journal-title":"Sci Comput Program"},{"key":"226_CR23","doi-asserted-by":"crossref","unstructured":"Hoare CAR (1978) Communicating sequential processes. In: Communications of the ACM, pp 666\u2013677","DOI":"10.1145\/359576.359585"},{"key":"226_CR24","volume-title":"Principal component analysis","author":"IT Jolliffe","year":"2002","unstructured":"Jolliffe IT (2002) Principal component analysis. Springer, New York"},{"issue":"1","key":"226_CR25","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(1): 291\u2013307","journal-title":"Bell Syst Tech J"},{"key":"226_CR26","doi-asserted-by":"crossref","unstructured":"Kindler E, Rubin V, Sch\u00e4fer W (2006) Process mining and Petri net synthesis. In: Eder J, Dustdar S (eds) Business process management workshops. Lecture notes in computer science, vol 4103. Springer, Heidelberg, pp 105\u2013116","DOI":"10.1007\/11837862_12"},{"issue":"1","key":"226_CR27","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10618-005-0029-z","volume":"13","author":"L Maruster","year":"2006","unstructured":"Maruster L, Weijters AJMM, van der Aalst WMP, van den Bosch A (2006) A rule-based approach for process discovery: Dealing with noise and imbalance in process logs. Data Min Knowl Discov 13(1): 67\u201387","journal-title":"Data Min Knowl Discov"},{"key":"226_CR28","doi-asserted-by":"crossref","unstructured":"McMillan KL (2001) Parameterized verification of the flash cache coherence protocol by compositional model checking. In: Margaria T, Melham TF (eds) Correct hardware design and verification methods (CHARME). Lecture notes in computer science, vol 2144. Springer, Heidelberg, pp 179\u2013195","DOI":"10.1007\/3-540-44798-9_17"},{"key":"226_CR29","doi-asserted-by":"crossref","unstructured":"Medeiros AKA, van der Aalst WMP, Weijters AJMM (2003) Workflow mining: Current status and future directions. In: Meersman R, Tari Z, Schmidt DC (eds) On the move to meaningful internet systems, CoopIS\/DOA\/ODBASE. Lecture notes in computer science, vol 2888. Springer, Heidelberg, pp 389\u2013406","DOI":"10.1007\/978-3-540-39964-3_25"},{"key":"226_CR30","doi-asserted-by":"crossref","unstructured":"Medeiros AA, Guzzo A, Greco G, van der Aalst W, Weijters A, van Dongen B, Sacca D (2008) Process mining based on clustering: A quest for precision. In: ter Hofstede A, Benatallah B, Paik H (eds) BPM 2007 international workshops (BPI, BPD, CBP, ProHealth, RefMod, Semantics4ws). Lecture notes in computer science, vol 4928. Springer, Berlin, pp 17\u201329","DOI":"10.1007\/978-3-540-78238-4_4"},{"issue":"2","key":"226_CR31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10618-006-0061-7","volume":"14","author":"AKA Medeiros","year":"2007","unstructured":"Medeiros AKA, Weijters AJMM, van der Aalst WMP (2007) Genetic process mining: an experimental evaluation. Data Min Knowl Discov 14(2): 245\u2013304","journal-title":"Data Min Knowl Discov"},{"key":"226_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A calculus of communicating systems. Lecture notes in computer science","author":"R Milner","year":"1980","unstructured":"Milner R (1980) A calculus of communicating systems. Lecture notes in computer science. Springer, Berlin"},{"issue":"4","key":"226_CR33","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1142\/S0129054192000231","volume":"3","author":"M Mukund","year":"1992","unstructured":"Mukund M (1992) Petri nets and step transition systems. Int J Found Comp Sci 3(4): 443\u2013478","journal-title":"Int J Found Comp Sci"},{"key":"226_CR34","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata T (1989) Petri nets: properties, analysis and applications. Proc IEEE 77: 541\u2013580","journal-title":"Proc IEEE"},{"key":"226_CR35","unstructured":"Pretorius AJ (2008) Visualization of state transition graphs. PhD thesis, Technical University of Eindhoven"},{"issue":"1","key":"226_CR36","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.is.2007.07.001","volume":"33","author":"A Rozinat","year":"2008","unstructured":"Rozinat A, van der Aalst WMP (2008) Conformance checking of processes based on monitoring real behavior. Inf Syst 33(1): 64\u201395","journal-title":"Inf Syst"},{"issue":"1\u20133","key":"226_CR37","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2007.08.005","volume":"388","author":"M Schaefer","year":"2007","unstructured":"Schaefer M, Vogler W (2007) Component refinement and csc-solving for stg decomposition. Theor Comp Sci 388(1\u20133): 243\u2013266","journal-title":"Theor Comp Sci"},{"key":"226_CR38","first-page":"309","volume-title":"Lecture notes in computer science: lectures on Petri nets I: basic models, vol 1491","author":"M Silva","year":"1998","unstructured":"Silva M, Teruel E, Colom JM (1998) Linear algebraic and linear programming techniques for the analysis of place\/transition net systems. In: Reisig W, Rozenberg G (eds) Lecture notes in computer science: lectures on Petri nets I: basic models, vol 1491. Springer, Berlin, pp 309\u2013373"},{"key":"226_CR39","doi-asserted-by":"crossref","unstructured":"Talupur M, Tuttle MR (2008) Going with the flow: Parameterized verification using message flows. In: Cimatti A, Jones RB (eds) Formal methods in computer-aided design (FMCAD), IEEE Press, Los Alamitos, pp 1\u20138","DOI":"10.1109\/FMCAD.2008.ECP.14"},{"key":"226_CR40","doi-asserted-by":"crossref","unstructured":"van der Aalst W, G\u00fcnther C (2007) Finding structure in unstructured processes: The case for process mining. In: Basten T, Juh\u00e1s G, Shukla SK Application of concurrency to system design (ACSD). IEEE Computer Society, Bratislava, pp 3\u201312","DOI":"10.1109\/ACSD.2007.50"},{"key":"226_CR41","doi-asserted-by":"crossref","unstructured":"van der Aalst W, Medeiros AKA, Weijters T. (2005) Genetic process mining. In: 26th international conference on applications and theory of Petri nets 2005 (ICATPN), Miami, USA, 20\u201325 June 2005. Proceedings. Lecture notes in computer science, vol 3536. Springer, Berlin, pp 48\u201369","DOI":"10.1007\/11494744_5"},{"issue":"9","key":"226_CR42","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1109\/TKDE.2004.47","volume":"16","author":"W Aalst van der","year":"2004","unstructured":"van der Aalst W, Weijters T, Maruster L (2004) Workflow mining: Discovering process models from event logs. IEEE Trans Knowl Data Eng 16(9): 1128\u20131142","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"226_CR43","doi-asserted-by":"crossref","unstructured":"van der Aalst W, Rubin V, Verbeek HMWE, Dongen B, Kindler E, G\u00fcnther, C (2009) Process mining: a two-step approach to balance between underfitting and overfitting. Softw Syst Model 9(1):87\u2013111 (2010)","DOI":"10.1007\/s10270-008-0106-z"},{"key":"226_CR44","unstructured":"Verbeek H, Pretorius A, van der Aalst WMP, van Wijk JJ (2007) On Petri-net synthesis and attribute-based visualization. In: Proc. workshop on petri nets and software engineering (PNSE\u201907), pp 127\u2013141"},{"key":"226_CR45","doi-asserted-by":"crossref","unstructured":"Vogler W (1992) Modular construction and partial order semantics of Petri nets. In: LNCS, vol 625. Springer, Heidelberg","DOI":"10.1007\/3-540-55767-9"},{"issue":"7","key":"226_CR46","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1109\/43.87601","volume":"10","author":"YC Wei","year":"1991","unstructured":"Wei YC, Cheng CK (1991) Ratio cut partitioning for hierarchical designs. IEEE Trans Comput-Aided Des Integr Circuits Syst 10(7): 911\u2013921. doi: 10.1109\/43.87601","journal-title":"IEEE Trans Comput-Aided Des Integr Circuits Syst"},{"issue":"2","key":"226_CR47","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10618-007-0065-y","volume":"15","author":"L Wen","year":"2007","unstructured":"Wen L, van der Aalst WMP, Wang J, Sun J (2007) Mining process models with non-free-choice constructs. Data Min Knowl Discov 15(2): 145\u2013180","journal-title":"Data Min Knowl Discov"},{"key":"226_CR48","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10844-007-0052-1","volume":"32","author":"L Wen","year":"2009","unstructured":"Wen L, Wang J, van der Aalst W, Huang B, Sun J (2009) A novel approach for process mining based on event types. J Intell Inf Syst 32: 163\u2013190","journal-title":"J Intell Inf Syst"},{"key":"226_CR49","unstructured":"Werf JMEM, van Dongen BF, Hurkens CAJ, Serebrenik A (2008) Process discovery using integer linear programming. In: van Hee KM, Valk R (eds) Petri Nets. 29th international conference on application and theory of Petri nets and other models of concurrency. Lecture notes in computer science, vol 5062. Springer, Berlin, pp 368\u2013387"},{"key":"226_CR50","unstructured":"Weijters A, van der Aalst W, de Medeiros AA (2006) Process mining with the heuristics miner-algorithm. Tech Rep WP 166, BETA Working Paper Series, Eindhoven University of Technology"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-011-0226-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-011-0226-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-011-0226-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T17:10:04Z","timestamp":1560273004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-011-0226-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,12]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s10618-011-0226-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,12]]}}}