{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T06:40:03Z","timestamp":1745995203413,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381423"},{"type":"electronic","value":"9783642381430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38143-0_9","type":"book-chapter","created":{"date-parts":[[2013,4,22]],"date-time":"2013-04-22T12:13:53Z","timestamp":1366632833000},"page":"314-371","source":"Crossref","is-referenced-by-count":7,"title":["Models from Scenarios"],"prefix":"10.1007","author":[{"given":"Robert","family":"Lorenz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Desel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Juh\u00e1s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), July 10-13, Bratislava, Slovak Republic. IEEE Computer Society (2007)"},{"key":"9_CR2","unstructured":"Badouel, E., Darondeau, P.: On the Synthesis of General Petri Nets. Technical Report 3025, Inria (1996)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-65306-6_22","volume-title":"Lectures on Petri Nets I: Basic Models","author":"E. Badouel","year":"1998","unstructured":"Badouel, E., Darondeau, P.: Theory of Regions. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 529\u2013586. Springer, Heidelberg (1998)"},{"key":"9_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":"4","key":"9_CR5","first-page":"437","volume":"88","author":"R. Bergenthum","year":"2008","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of Petri Nets from Finite Partial Languages. Fundam. Inform.\u00a088(4), 437\u2013468 (2008)","journal-title":"Fundam. Inform."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-00899-3_14","volume-title":"Transactions on Petri Nets and Other Models of Concurrency II","author":"R. Bergenthum","year":"2009","unstructured":"Bergenthum, R., Desel, J., Mauser, S., Lorenz, R.: Construction of process models from example runs. In: Jensen, K., van der Aalst, W.M.P. (eds.) ToPNoC II. LNCS, vol.\u00a05460, pp. 243\u2013259. Springer, Heidelberg (2009)"},{"issue":"1","key":"9_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.3233\/FI-2009-147","volume":"95","author":"R. Bergenthum","year":"2009","unstructured":"Bergenthum, R., Desel, J., Mauser, S., Lorenz, R.: Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages. Fundam. Inform.\u00a095(1), 187\u2013217 (2009)","journal-title":"Fundam. Inform."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-63141-0_11","volume-title":"CONCUR\u201997: Concurrency Theory","author":"N. Busi","year":"1997","unstructured":"Busi, N., Pinna, G.M.: Synthesis of Nets with Inhibitor Arcs. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 151\u2013165. Springer, Heidelberg (1997)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44988-4_1","volume-title":"Application and Theory of Petri Nets 2000","author":"J. Cortadella","year":"2000","unstructured":"Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: Hardware and Petri Nets: Application to Asynchronous Circuit Design. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 1\u201315. Springer, Heidelberg (2000)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/BFb0055646","volume-title":"CONCUR \u201998 Concurrency Theory","author":"P. Darondeau","year":"1998","unstructured":"Darondeau, P.: Deriving Unbounded Petri Nets from Formal Languages. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 533\u2013548. Springer, Heidelberg (1998)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-540-27755-2_11","volume-title":"Lectures on Concurrency and Petri Nets","author":"P. Darondeau","year":"2004","unstructured":"Darondeau, P.: Unbounded Petri Net Synthesis. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol.\u00a03098, pp. 413\u2013438. Springer, Heidelberg (2004)"},{"key":"9_CR12","series-title":"LNBIP","first-page":"84","volume-title":"UNISCON","author":"J. Desel","year":"2008","unstructured":"Desel, J.: From Human Knowledge to Process Models. In: Kaschek, R., Kop, C., Steinberger, C., Fliedl, G. (eds.) UNISCON. LNBIP, vol.\u00a05, pp. 84\u201395. Springer, Heidelberg (2008)"},{"key":"9_CR13","unstructured":"Desel, J.: VipTool-Homepage (2010), http:\/\/www.fernuni-hagen.de\/se\/viptool.html"},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00264611","volume":"27","author":"A. Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-Structures. Part I: Basic Notions and the Representation Problem \/ Part II: State Spaces of Concurrent Systems. Acta Inf.\u00a027(4), 315\u2013368 (1989)","journal-title":"Acta Inf."},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF00264612","volume":"27","author":"A. Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-Structures. Part II: State Spaces of Concurrent Systems. Acta Inf.\u00a027(4), 343\u2013368 (1989)","journal-title":"Acta Inf."},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1006\/inco.1995.1032","volume":"117","author":"P. Hoogers","year":"1995","unstructured":"Hoogers, P., Kleijn, H., Thiagarajan, P.: A Trace Semantics for Petri Nets. Information and Computation\u00a0117(1), 98\u2013114 (1995)","journal-title":"Information and Computation"},{"issue":"3","key":"9_CR17","doi-asserted-by":"crossref","first-page":"387","DOI":"10.3233\/FI-2009-136","volume":"94","author":"C.H.J. Werf van der","year":"2009","unstructured":"van der Werf, C.H.J., van Dongen, B., Serebrenik, A.: Process Discovery using Integer Linear Programming. Fundamenta Informaticae\u00a094(3), 387\u2013412 (2009)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1995.1153","volume":"123","author":"R. Janicki","year":"1995","unstructured":"Janicki, R., Koutny, M.: Semantics of Inhibitor Nets. Inf. Comput.\u00a0123(1), 1\u201316 (1995)","journal-title":"Inf. Comput."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-36190-1_2","volume-title":"Concurrency and Hardware Design","author":"M.B. Josephs","year":"2002","unstructured":"Josephs, M.B., Furey, D.P.: A Programming Approach to the Design of Asynchronous Logic Blocks. In: Cortadella, J., Yakovlev, A., Rozenberg, G. (eds.) Concurrency and Hardware Design. LNCS, vol.\u00a02549, pp. 34\u201360. Springer, Heidelberg (2002)"},{"issue":"3-4","key":"9_CR20","doi-asserted-by":"crossref","first-page":"331","DOI":"10.3233\/FUN-2008-873-404","volume":"87","author":"G. Juhas","year":"2008","unstructured":"Juhas, G., Lorenz, R., Mauser, S.: Complete Process Semantics of Petri Nets. Fundamenta Informaticae\u00a087(3-4), 331\u2013365 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"9_CR21","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ic.2003.11.002","volume":"190","author":"H.C.M. Kleijn","year":"2004","unstructured":"Kleijn, H.C.M., Koutny, M.: Process Semantics of General Inhibitor Nets. Inf. Comput.\u00a0190(1), 18\u201369 (2004)","journal-title":"Inf. Comput."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BFb0028590","volume-title":"STACS 98","author":"K. Lodaya","year":"1998","unstructured":"Lodaya, K., Weil, P.: Series-Parallel Posets: Algebra, Automata and Languages. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 555\u2013565. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K. Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-Parallel Languages and the Bounded-Width Property. Theor. Comput. Sci.\u00a0237(1-2), 347\u2013380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR24","unstructured":"Lorenz, R.: Synops-Homepage (2010), http:\/\/www.informatik.uni-augsburg.de\/lehrstuehle\/inf\/projekte\/synops\/"},{"issue":"12-13","key":"9_CR25","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1016\/j.tcs.2008.11.014","volume":"410","author":"R. Lorenz","year":"2009","unstructured":"Lorenz, R., Juh\u00e1s, G., Bergenthum, R., Desel, J., Mauser, S.: Executability of Scenarios in Petri Nets. Theor. Comput. Sci.\u00a0410(12-13), 1190\u20131216 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-73094-1_21","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"R. Lorenz","year":"2007","unstructured":"Lorenz, R., Mauser, S., Bergenthum, R.: Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol.\u00a04546, pp. 342\u2013361. Springer, Heidelberg (2007)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Lorenz, R., Mauser, S., Juh\u00e1s, G.: How to Synthesize Nets from Languages: A Survey. In: Henderson, S.G., Biller, B., Hsieh, M.-H., Shortle, J., Tew, J.D., Barton, R.R. (eds.) Winter Simulation Conference, pp. 637\u2013647. WSC (2007)","DOI":"10.1109\/WSC.2007.4419657"},{"issue":"4","key":"9_CR28","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1142\/S0129054192000231","volume":"3","author":"M. Mukund","year":"1992","unstructured":"Mukund, M.: Petri Nets and Step Transition Systems. Int. J. Found. Comput. Sci.\u00a03(4), 443\u2013478 (1992)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2-3","key":"9_CR29","doi-asserted-by":"crossref","first-page":"251","DOI":"10.3233\/FI-1999-402307","volume":"40","author":"M. Pietkiewicz-Koutny","year":"1999","unstructured":"Pietkiewicz-Koutny, M.: The Synthesis Problem for Elementary Net Systems with Inhibitor Arcs. Fundam. Inform.\u00a040(2-3), 251\u2013283 (1999)","journal-title":"Fundam. Inform."},{"issue":"2","key":"9_CR30","first-page":"175","volume":"50","author":"M. Pietkiewicz-Koutny","year":"2002","unstructured":"Pietkiewicz-Koutny, M.: Synthesising Elementary Net Systems with Inhibitor Arcs from Step Transition Systems. Fundam. Inform.\u00a050(2), 175\u2013203 (2002)","journal-title":"Fundam. Inform."},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P., G\u00fcnther, C.W.: Finding Structure in Unstructured Processes: The Case for Process Mining. In: ACSD [1], pp. 3\u201312","DOI":"10.1109\/ACSD.2007.50"},{"issue":"2","key":"9_CR32","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0169-023X(03)00066-1","volume":"47","author":"W.M.P. Aalst van der","year":"2003","unstructured":"van der Aalst, W.M.P., van Dongen, B.F., Herbst, J., Maruster, L., Schimm, G., Weijters, A.J.M.M.: Workflow Mining: A Survey of Issues and Approaches. Data Knowl. Eng.\u00a047(2), 237\u2013267 (2003)","journal-title":"Data Knowl. Eng."},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Zhou, M., Cesare, F.D.: Petri Net Synthesis for Discrete Event Control of Manufacturing Systems. Kluwer (1993)","DOI":"10.1007\/978-1-4615-3126-5"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency VII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38143-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T06:05:33Z","timestamp":1745993133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38143-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381423","9783642381430"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38143-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}