{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:09:41Z","timestamp":1743152981499,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642048548"},{"type":"electronic","value":"9783642048562"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04856-2_9","type":"book-chapter","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T07:41:51Z","timestamp":1257320511000},"page":"216-243","source":"Crossref","is-referenced-by-count":7,"title":["Comparison of Different Algorithms to Synthesize a Petri Net from a Partial Language"],"prefix":"10.1007","author":[{"given":"Robin","family":"Bergenthum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Desel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Mauser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Badouel, E., Darondeau, P.: On the Synthesis of General Petri Nets. Technical Report 3025, Inria (1996)"},{"key":"9_CR2","first-page":"170","volume-title":"ACSD 2008","author":"R. Bergenthum","year":"2008","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of Petri Nets from Infinite Partial Languages. In: ACSD 2008, pp. 170\u2013179. IEEE, Los Alamitos (2008)"},{"key":"9_CR3","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: VipTool-Homepage (2009), \n                    http:\/\/viptool.ku-eichstaett.de"},{"issue":"3","key":"9_CR4","first-page":"315","volume":"E80-D","author":"J. Cortadella","year":"1997","unstructured":"Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: Petrify: A Tool for Manipulating Concurrent Specifications and Synthesis of Asynchronous Controllers. IEICE Trans. of Informations and Systems\u00a0E80-D(3), 315\u2013325 (1997)","journal-title":"IEICE Trans. of Informations and Systems"},{"key":"9_CR5","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_CR6","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)"},{"issue":"4","key":"9_CR7","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":"2","key":"9_CR8","doi-asserted-by":"crossref","first-page":"428","DOI":"10.3233\/FI-1981-4210","volume":"4","author":"J. Grabowski","year":"1981","unstructured":"Grabowski, J.: On Partial Languages. Fundamenta Informaticae\u00a04(2), 428\u2013498 (1981)","journal-title":"Fundamenta Informaticae"},{"issue":"1-3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.biosystems.2004.03.003","volume":"75","author":"M. Heiner","year":"2004","unstructured":"Heiner, M., Koch, I., Will, J.: Model Validation of Biological Pathways Using Petri Nets - Demonstrated for Apoptosis. Journal BioSystems\u00a075(1-3), 15\u201328 (2004)","journal-title":"Journal BioSystems"},{"issue":"1","key":"9_CR10","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"},{"key":"9_CR11","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":"1\/2","key":"9_CR12","first-page":"3","volume":"24","author":"A. Kiehn","year":"1988","unstructured":"Kiehn, A.: On the Interrelation Between Synchronized and Non-Synchronized Behaviour of Petri Nets. Elektronische Informationsverarbeitung und Kybernetik\u00a024(1\/2), 3\u201318 (1988)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1138953.1138956","volume-title":"SCESM 2006","author":"H. Liang","year":"2006","unstructured":"Liang, H., Dingel, J., Diskin, Z.: A Comparative Survey of Scenario-Based to State-Based Model Synthesis Approaches. In: SCESM 2006, pp. 5\u201312. ACM, New York (2006)"},{"issue":"4","key":"9_CR14","first-page":"437","volume":"88","author":"R. Lorenz","year":"2009","unstructured":"Lorenz, R., Bergenthum, R., Desel, J., Mauser, S.: Synthesis of Petri Nets from Finite Partial Languages. Fundamenta Informaticae\u00a088(4), 437\u2013468 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"9_CR15","first-page":"157","volume-title":"ACSD","author":"R. Lorenz","year":"2007","unstructured":"Lorenz, R., Bergenthum, R., Mauser, S., Desel, J.: Synthesis of Petri Nets from Finite Partial Languages. In: ACSD, pp. 157\u2013166. IEEE, Los Alamitos (2007)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/11767589_17","volume-title":"Petri Nets and Other Models of Concurrency - ICATPN 2006","author":"R. Lorenz","year":"2006","unstructured":"Lorenz, R., Juh\u00e1s, G.: Towards Synthesis of Petri Nets from Scenarios. In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol.\u00a04024, pp. 302\u2013321. Springer, Heidelberg (2006)"},{"key":"9_CR17","first-page":"637","volume-title":"WSC","author":"R. Lorenz","year":"2007","unstructured":"Lorenz, R., Juh\u00e1s, G., Mauser, S.: How to Synthesize Nets from Languages - a Survey. In: WSC, pp. 637\u2013647. IEEE, Los Alamitos (2007)"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"Pratt, V.: Modelling Concurrency with Partial Orders. Int. Journal of Parallel Programming\u00a015, 33\u201371 (1986)","journal-title":"Int. Journal of Parallel Programming"},{"key":"9_CR19","volume-title":"Theory of Linear and Integer Programming.","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"9_CR20","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. van der Aalst","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, E., Weijters, A.J.M.M.: 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":"9_CR21","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TKDE.2004.47","volume":"16","author":"W.M.P. van der Aalst","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":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/978-3-540-27793-4_22","volume-title":"Applications and Theory of Petri Nets 2004","author":"E. Verbeek","year":"2004","unstructured":"Verbeek, E., van der Toorn, R.A.: Transit Case Study. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol.\u00a03099, pp. 391\u2013410. Springer, Heidelberg (2004)"},{"key":"9_CR23","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","Transactions on Petri Nets and Other Models of Concurrency III"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04856-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T14:05:26Z","timestamp":1674741926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-04856-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642048548","9783642048562"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04856-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}