{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:46:29Z","timestamp":1766450789597},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T00:00:00Z","timestamp":1188000000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2007,11,5]]},"DOI":"10.1007\/s10626-007-0025-0","type":"journal-article","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T15:26:46Z","timestamp":1187969206000},"page":"447-474","source":"Crossref","is-referenced-by-count":63,"title":["Identification of Petri Nets from Knowledge of Their Language"],"prefix":"10.1007","volume":"17","author":[{"given":"Maria Paola","family":"Cabasino","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Giua","sequence":"additional","affiliation":[]},{"given":"Carla","family":"Seatzu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,8,25]]},"reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D Angluin","year":"1982","unstructured":"Angluin D (1982) Inference of reversible languages. J ACM 29(3):741\u2013765","journal-title":"J ACM"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Badouel E, Bernardinello L, Darondeau P (1995) Polynomial algorithms for the synthesis of bounded nets. In: Proceedings of CAAP\u201995, Lecture Notes in Computer Science. 915:647\u2013679","DOI":"10.1007\/3-540-59293-8_207"},{"key":"25_CR3","unstructured":"Badouel E, Darondeau P (1996) On the synthesis of general petri nets. Technical Report 3025"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Badouel E, Darondeau P (1998) Theory of regions. In: Lecture Notes in Computer Science: Lectures on Petri Nets I: Basic Models, 1491:529\u2013586","DOI":"10.1007\/3-540-65306-6_22"},{"issue":"3","key":"25_CR5","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0005-1098(98)00178-2","volume":"35","author":"A Bemporad","year":"1999","unstructured":"Bemporad A, Morari M (1999) Control of systems integrating logic, dynamics and constraints. Automatica 35(3):407\u2013429","journal-title":"Automatica"},{"key":"25_CR6","unstructured":"Bourdeaud\u2019huy T, Yim P (2004) Synth\u00e8se de r\u00e9seaux de Petri \u00e0 partir d\u2019exigences. In: Actes de la 5me conf. francophone de Mod\u00e9lisation et Simulation, Nantes, France, pp 413\u2013420, September 2004"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0167-6377(91)90018-K","volume":"10","author":"RE Burkard","year":"1991","unstructured":"Burkard RE, Rendl F (1991) Lexicographic bottleneck problems. Oper Res Lett 10:303\u2013308","journal-title":"Oper Res Lett"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Cabasino MP, Giua A, Seatzu C (2006) Identification of deterministic Petri nets. In: Proceedings WODES\u201906: 8th Work on Discrete Event Systems, Ann-Arbor, MI, USA, July 2006","DOI":"10.1109\/WODES.2006.382527"},{"issue":"8","key":"25_CR9","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":"25_CR10","doi-asserted-by":"crossref","unstructured":"Dotoli M, Fanti MP, Mangini AM (2006) An optimization approach for identification of Petri nets. In: Proceedings IFAC WODES\u201906: 8th Work on Discrete Event Systems, Ann-Arbor, MI, USA, July 2006","DOI":"10.1109\/WODES.2006.382528"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Giua A, Seatzu C (2005) Identification of free-labeled Petri nets via integer programming. In: Proceedings 44th IEEE Conf on Decision and Control, Seville, Spain, December 2005","DOI":"10.1109\/CDC.2005.1583395"},{"issue":"3","key":"25_CR12","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"EM Gold","year":"1978","unstructured":"Gold EM (1978) Complexity of automaton identification from given data. Inf Control 37(3):302\u2013320","journal-title":"Inf Control"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Hiraishi K (1992) Construction of a class of safe Petri nets by presenting firing sequences. In: Jensen\u00a0K (ed) Lecture Notes in Computer Science; 13th International Conference on Application and Theory of Petri Nets 1992, Sheffield, UK, vol 616. Springer, pp 244\u2013262, June 1992","DOI":"10.1007\/3-540-55676-1_14"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Li L, Ru Y, Hadjicostis CN (2006) Least-cost firing sequence estimation in labeled Petri nets. In: Proceedings 45th IEEE Conf on Decision and Control, San Diego, California USA, December 2006","DOI":"10.1109\/CDC.2006.377182"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Lorenz R, Juh\u00e1s G (2006) Towards synthesis of Petri nets from scenarios. In: Proceedings of 27th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, Turku, Finland, pp 302\u2013321","DOI":"10.1007\/11767589_17"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Meda-Campa\u00f1a ME, L\u00f3pez-Mellado E (2002) Incremental synthesis of Petri net models for identification of discrete event systems. In: Proceedings 41th IEEE Conf on Decision and Control, pp 805\u2013810, Las Vegas, NV, USA, December 2002","DOI":"10.1109\/CDC.2002.1184604"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Meda-Campa\u00f1a ME, L\u00f3pez-Mellado E (2003) Required event sequences for identification of discrete event systems. In: Proceedings 42th IEEE Conf on Decision and Control, pp 3778\u20133783, Maui, HI, USA, December 2003","DOI":"10.1109\/CDC.2003.1271737"},{"issue":"4","key":"25_CR18","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. Proceedings of the IEEE, 77(4):541\u2013580, April 1989","journal-title":"Proceedings of the IEEE"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Reveliotis SA, Choi JY (2006) Designing reversibility-enforcing supervisors of polynomial complexity for bounded Petri nets through the theory of regions. In: Proceedings of 27th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, Turku, Finland, pp 322\u2013341","DOI":"10.1007\/11767589_18"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Ru Y, Hadjicostis CN (2006) State estimation in discrete event systems modeled by labeled Petri nets. In: Proceedings 45th IEEE Conf on Decision and Control, San Diego, CA, USA, December 2006","DOI":"10.1109\/CDC.2006.377126"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Sreenivas RS (2002) On minimal representations of Petri net languages. In: Proceedings WODES\u201902: 6th Work on Discrete Event Systems, Zaragoza, Spain, pp 237\u2013242, October 2002","DOI":"10.1109\/WODES.2002.1167694"},{"issue":"1\u20132","key":"25_CR22","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0304-4076(03)00145-3","volume":"118","author":"J Schuppen van","year":"2004","unstructured":"van Schuppen JH (2004) System theory for system identification. J Econom 118(1\u20132):313\u2013339, January\u2013February 2004","journal-title":"J Econom"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-007-0025-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-007-0025-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-007-0025-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:51Z","timestamp":1559246331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-007-0025-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,25]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11,5]]}},"alternative-id":["25"],"URL":"https:\/\/doi.org\/10.1007\/s10626-007-0025-0","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,25]]}}}