{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:27:44Z","timestamp":1761488864822},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592938"},{"type":"electronic","value":"9783540492337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59293-8_207","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:11:13Z","timestamp":1330276273000},"page":"364-378","source":"Crossref","is-referenced-by-count":70,"title":["Polynomial algorithms for the synthesis of bounded nets"],"prefix":"10.1007","author":[{"given":"Eric","family":"Badouel","sequence":"first","affiliation":[]},{"given":"Luca","family":"Bernardinello","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Darondeau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"24_CR1","unstructured":"Badouel, E., Bernardinello, L., and Darondeau, Ph., The Synthesis Problem for Elementary Net Systems is NP-Complete. Irisa\/Inria research report to appear (1995)."},{"key":"24_CR2","volume-title":"Graphes et hypergraphes","author":"C. Berge","year":"1970","unstructured":"Berge, C., Graphes et hypergraphes. Dunod, Paris (1970)."},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-56863-8_42","volume":"691","author":"L. Bernardinello","year":"1993","unstructured":"Bernardinello, L., Synthesis of Net Systems. Application and Theory of Petri Nets, Springer-Verlag Lecture Notes in Computer Science, vol. 691 (1993) 89\u2013105.","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"24_CR4","unstructured":"Bernardinello, L., De Michelis, G., and Petruni, K., Synchronie distances as Generalized Regions. Rapporto Interno n. 107-93, Dipartimento di Scienze dell'Informazione, Universit\u00e0 degli Studi di Milano (1993)."},{"key":"24_CR5","volume-title":"The Synthesis Problem of Petri Nets","author":"J. Desel","year":"1992","unstructured":"Desel, J., and Reisig, W., The Synthesis Problem of Petri Nets. TUM research report, Munich (1992)."},{"key":"24_CR6","first-page":"172","volume":"number 48","author":"M. Droste","year":"1992","unstructured":"Droste, M., and Shortt, R.M., Bounded Petri Nets of Finite Dimension have only Finitely Many Reachable Markings. Bulletin of the European Association for Computer Science, number 48, (1992) 172\u2013174.","journal-title":"Bulletin of the European Association for Computer Science"},{"key":"24_CR7","unstructured":"Droste, M., and Shortt, R.M., Petri Nets and Automata with Concurrency Relations \u2014 an Adjunction. in \u201dSemantics of Programming Languages and Model Theory\u201d, M. Droste and Y. Gurevich eds(1993) 69\u201387."},{"key":"24_CR8","unstructured":"Ehrenfeucht, A., and Rozenberg, G., Partial 2-structures; Part I: Basic Notions and the Representation Problem, and Part II: State Spaces of Concurrent Systems, Acta Informatica, vol 27 (1990)."},{"key":"24_CR9","volume-title":"Graphes et algorithmes","author":"M. Gondran","year":"1985","unstructured":"Gondran, M., and Minoux, M., Graphes et algorithmes. Eyrolles, Paris (1985)."},{"key":"24_CR10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0304-3975(94)90112-0","volume":"135","author":"K Hiraishi","year":"1994","unstructured":"Hiraishi, K., Some complexity results on transitions systems and elementary net systems. Theoretical Computer Science 135 (1994) 361\u2013376.","journal-title":"Theoretical Computer Science"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Hoogers, P.W., Kleijn, H.C.M., and Thiagarajan, P.S., A trace semantics for Petri nets. Springer-Verlag, Lecture Notes in Computer Science, vol. 623 (1992) 595\u2013604.","DOI":"10.1007\/3-540-55719-9_107"},{"key":"24_CR12","unstructured":"Mukund, M., Petri Nets and Step Transition Systems. International Journal of Foundation of Computer Science, vol 3, n\u00b0 3 (1993)."},{"key":"24_CR13","unstructured":"Schrijver, A., Theory of Linear and Integer Programming. John Wiley (1986)."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '95: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59293-8_207.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:27:02Z","timestamp":1619573222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59293-8_207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592938","9783540492337"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-59293-8_207","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}