{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:50:23Z","timestamp":1761486623890},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5768,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0304-3975(96)00219-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"107-134","source":"Crossref","is-referenced-by-count":61,"title":["The synthesis problem for elementary net systems is NP-complete"],"prefix":"10.1016","volume":"186","author":[{"given":"Eric","family":"Badouel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Bernardinello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Darondeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00219-8_BIB1","series-title":"Proc. CAAP'95","first-page":"364","article-title":"Polynomial algorithms for the synthesis of bounded nets","volume":"Vol. 915","author":"Badouel","year":"1995"},{"key":"10.1016\/S0304-3975(96)00219-8_BIB2","series-title":"Proc. ICATPN'93","first-page":"89","article-title":"Synthesis of net systems","volume":"Vol. 691","author":"Bernardinello","year":"1993"},{"key":"10.1016\/S0304-3975(96)00219-8_BIB3","series-title":"Structures in Concurrency Theory (STRICT)","first-page":"11","article-title":"On the synchronic structure of transition systems","author":"Bernardinello","year":"1996"},{"key":"10.1016\/S0304-3975(96)00219-8_BIB4","series-title":"Proc. 2nd Internat. Symp. on Advanced Research in Asynchronous Circuits and Systems","article-title":"Complete State Encoding based on the Theory of Regions","author":"Cortadella","year":"1996"},{"key":"10.1016\/S0304-3975(96)00219-8_BIB5","series-title":"Proc. ICCAD'95","first-page":"164","article-title":"Synthesizing Petri nets from state-based models","author":"Cortadella","year":"1995"},{"key":"10.1016\/S0304-3975(96)00219-8_BIB6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s002360050046","article-title":"The synthesis problem of Petri nets","volume":"33","author":"Desel","year":"1996","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(96)00219-8_BIB7","series-title":"Semantics of Programming Languages and Model Theory","first-page":"69","article-title":"Petri nets and automata with concurrency relations \u2014 an adjunction","author":"Droste","year":"1993"},{"key":"10.1016\/S0304-3975(96)00219-8_BIB8_1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00264611","article-title":"Partial 2-structures; Part I: Basic notions and the representation problem","volume":"27","author":"Ehrenfeucht","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(96)00219-8_BIB8_2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00264611","article-title":"Partial 2-structures; Part II: State spaces of concurrent systems","volume":"27","author":"Ehrenfeucht","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(96)00219-8_BIB9","series-title":"Computer and Intractability. A Guide to the theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(96)00219-8_BIB10","series-title":"Graphes et Algorithmes","author":"Gondran","year":"1985"},{"key":"10.1016\/S0304-3975(96)00219-8_BIB11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0304-3975(94)90112-0","article-title":"Some complexity results on transitions systems and elementary net systems","volume":"135","author":"Hiraishi","year":"1994","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(96)00219-8_BIB12","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1142\/S0129054192000231","article-title":"Petri nets and step transition systems","volume":"3","author":"Mukund","year":"1992","journal-title":"Internat. J. Foundation Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00219-8_BIB13","series-title":"Proc. STACS'96","first-page":"517","article-title":"Flip-flop nets","volume":"Vol. 1046","author":"Schmitt","year":"1996"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002198?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002198?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:59:23Z","timestamp":1555405163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0304397596002198"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00219-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}