{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:18Z","timestamp":1740099618896,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662606506"},{"type":"electronic","value":"9783662606513"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-662-60651-3_9","type":"book-chapter","created":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T01:04:25Z","timestamp":1574211865000},"page":"222-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Relabelling LTS for Petri Net Synthesis via Solving Separation Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5063-025X","authenticated-orcid":false,"given":"Uli","family":"Schlachter","sequence":"first","affiliation":[]},{"given":"Harro","family":"Wimmel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,21]]},"reference":[{"key":"9_CR1","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47967-4","volume-title":"Petri Net Synthesis","author":"Eric Badouel","year":"2015","unstructured":"Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. TTCS, 339 p. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-47967-4"},{"issue":"1\u20134","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2017-1548","volume":"154","author":"\u00c9 Badouel","year":"2017","unstructured":"Badouel, \u00c9., Schlachter, U.: Incremental process discovery using Petri net synthesis. Fundamenta Informaticae 154(1\u20134), 1\u201313 (2017). \nhttps:\/\/doi.org\/10.3233\/FI-2017-1548","journal-title":"Fundamenta Informaticae"},{"unstructured":"Barylska, K., Best, E., Erofeev, E., Mikulski, \u0141., Pi\u0105tkowski, M.: On binary words being Petri net solvable. In: Carmona, J., Bergenthum, R., van der Aalst, W. (eds) ATAED 2015, pp. 1\u201315 (2015). \nhttp:\/\/ceur-ws.org\/Vol-1371","key":"9_CR3"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-51963-0_13","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"E Best","year":"2017","unstructured":"Best, E., Devillers, R., Schlachter, U.: A graph-theoretical characterisation of state separation. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 163\u2013175. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-51963-0_13"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.dss.2017.04.005","volume":"100","author":"SKLM Broucke vanden","year":"2017","unstructured":"vanden Broucke, S.K.L.M., De Weerdt, J.: Fodina: a robust and flexible heuristic process discovery technique. Decis. Support Syst. 100, 109\u2013118 (2017). \nhttps:\/\/doi.org\/10.1016\/j.dss.2017.04.005","journal-title":"Decis. Support Syst."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-35179-2_1","volume-title":"Transactions on Petri Nets and Other Models of Concurrency VI","author":"J Carmona","year":"2012","unstructured":"Carmona, J.: The label splitting problem. In: Jensen, K., van der Aalst, W.M., Ajmone Marsan, M., Franceschinis, G., Kleijn, J., Kristensen, L.M. (eds.) Transactions on Petri Nets and Other Models of Concurrency VI. LNCS, vol. 7400, pp. 1\u201323. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35179-2_1"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-68746-7_10","volume-title":"Applications and Theory of Petri Nets","author":"J Carmona","year":"2008","unstructured":"Carmona, J., Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: A symbolic algorithm for the synthesis of bounded Petri nets. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 92\u2013111. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-68746-7_10"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-31759-0_19","volume-title":"Model Checking Software","author":"J Christ","year":"2012","unstructured":"Christ, J., Hoenicke, J., Nutz, A.: SMTInterpol: an interpolating SMT solver. In: Donaldson, A., Parker, D. (eds.) SPIN 2012. LNCS, vol. 7385, pp. 248\u2013254. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31759-0_19\n\n. \nhttps:\/\/ultimate.informatik.uni-freiburg.de\/smtinterpol\/"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00264611","volume":"27","author":"A Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Partial 2-structures, Part I: basic notions and the representation problem, and Part II: state spaces of concurrent systems. Acta Informatica 27(4), 315\u2013368 (1990)","journal-title":"Acta Informatica"},{"key":"9_CR10","first-page":"1","volume":"124","author":"G Farkas","year":"1902","unstructured":"Farkas, G.: \u00dcber die Theorie der einfachen Ungleichungen. Journal f\u00fcr die Reine und Angewandte Mathematik 124, 1\u201327 (1902)","journal-title":"Journal f\u00fcr die Reine und Angewandte Mathematik"},{"unstructured":"Hack, M.H.T.: Petri Net Languages. Computation Structures Memo 124, Project MAC, MIT (1975)","key":"9_CR11"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373\u2013395 (1984). \nhttps:\/\/doi.org\/10.1007\/BF02579150","journal-title":"Combinatorica"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-319-45348-4_6","volume-title":"Business Process Management","author":"X Lu","year":"2016","unstructured":"Lu, X., Fahland, D., van den Biggelaar, F.J.H.M., van der Aalst, W.M.P.: Handling duplicated tasks in process discovery by refining event labels. In: La Rosa, M., Loos, P., Pastor, O. (eds.) BPM 2016. LNCS, vol. 9850, pp. 90\u2013107. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-45348-4_6"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77, 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains, part I. Theoret. Comput. Sci. 13(1), 85\u2013100 (1981). \nhttps:\/\/doi.org\/10.1016\/0304-3975(81)90112-2","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR16","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets","author":"W Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets. EATCS Monographs on Theoretical Computer Science, vol. 4. Springer, Heidelberg (1985). \nhttps:\/\/doi.org\/10.1007\/978-3-642-69968-9"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-319-45348-4_7","volume-title":"Business Process Management","author":"J San Pedro de","year":"2016","unstructured":"de San Pedro, J., Cortadella, J.: Discovering duplicate tasks in transition systems for the simplification of process models. In: La Rosa, M., Loos, P., Pastor, O. (eds.) BPM 2016. LNCS, vol. 9850, pp. 108\u2013124. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-45348-4_7"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-91268-4_6","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"U Schlachter","year":"2018","unstructured":"Schlachter, U., Wimmel, H.: A geometric characterisation of event\/state separation. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 99\u2013116. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-91268-4_6"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-319-77313-1_23","volume-title":"Language and Automata Theory and Applications","author":"U Schlachter","year":"2018","unstructured":"Schlachter, U.: Over-approximative Petri net synthesis for restricted subclasses of nets. In: Klein, S.T., Mart\u00edn-Vide, C., Shapira, D. (eds.) LATA 2018. LNCS, vol. 10792, pp. 296\u2013307. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-77313-1_23"},{"unstructured":"Tredup, R., Rosenke, C.: Towards completely characterizing the complexity of boolean nets synthesis. ArXiv \nhttps:\/\/arxiv.org\/abs\/1806.03703v3\n\n (2018)","key":"9_CR20"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-19345-3","volume-title":"Process Mining: Discovery, Conformance and Enhancement of Business Processes","author":"WMP Aalst van der","year":"2011","unstructured":"van der Aalst, W.M.P.: Process Mining: Discovery, Conformance and Enhancement of Business Processes, p. 352. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-19345-3\n\n. ISBN 978-3642193446"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency XIV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-60651-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T01:11:42Z","timestamp":1574212302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-60651-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662606506","9783662606513"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-60651-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}