{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:00Z","timestamp":1725467400860},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648963"},{"type":"electronic","value":"9783540684558"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055646","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T07:31:00Z","timestamp":1153985460000},"page":"533-548","source":"Crossref","is-referenced-by-count":29,"title":["Deriving unbounded Petri nets from formal languages"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Darondeau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Autebert, J.M., Berstel, J., and Boasson, L., Context-Free Languages and Pushdown Automata. In vol. 1 of \u201cHandbook of Formal Languages\u201d, G. Rozenberg and A. Salomaa eds., Springer-Verlag (1997) 111\u2013174","DOI":"10.1007\/978-3-642-59136-5_3"},{"key":"35_CR2","first-page":"647","volume":"915","author":"E. Badouel","year":"1995","unstructured":"Badouel, E., Bernardinello, L. and Darondeau, Ph., Polynomial algorithms for the synthesis of bounded nets, Proceedings Caap 95, Lecture Notes in Computer Science 915 (1995) 647\u2013679.","journal-title":"Lecture Notes in Computer Science"},{"key":"35_CR3","unstructured":"Badouel, E. and Darondeau, Ph., On the Synthesis of General Petri Nets, Inria Research Report no 3025 (1996)."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Bernardinello, L., De Michelis, G., Petruni, K., and Vigna, S., On the Synchronic Structure of Transitions Systems. In \u201cStructures in Concurrency Theory\u201d, J. Desel ed., Springer-Verlag (1996) 11\u201331.","DOI":"10.1007\/978-1-4471-3078-9_5"},{"key":"35_CR5","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/3-540-61604-7_71","volume":"1119","author":"A. Bouajjani","year":"1995","unstructured":"Bouajjani, A., and Habermehl, P., Constrained Properties, Semilinear Systems, and Petri Nets. Proceedings Concur 95, Lecture Notes in Computer Science 1119 (1995) 481\u2013497.","journal-title":"Lecture Notes in Computer Science"},{"key":"35_CR6","unstructured":"Caillaud, B., Synet: un outil de synth\u00e8se de r\u00e9seaux de Petri born\u00e9s, applications Inria Research Report no 3155 (1997)."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Cortadella, J., Kishinevsky, M., Lavagno, L., and Yakovlev, A., Synthesizing Petri Nets from State-Based Models. Proceedings of ICCAD'95 (1995) 164\u2013171.","DOI":"10.1109\/ICCAD.1995.480008"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s002360050046","volume":"33","author":"J. Desel","year":"1996","unstructured":"Desel, J., and Reisig, W., The Synthesis Problem of Petri Nets. Acta Informatica, vol. 33 (1996) 297\u2013315.","journal-title":"Acta Informatica"},{"key":"35_CR9","first-page":"172","volume":"No.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. EATCS Bulletin No.48 (1992) 172\u2013175.","journal-title":"EATCS Bulletin"},{"key":"35_CR10","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":"35_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00264611","volume":"27","author":"A. Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., and Rozenberg, G., Partial (Set) 2-Structures; Part I: Basic Notions and the Representation Problem. Acta Informatica, vol. 27 (1990) 315\u2013342.","journal-title":"Acta Informatica"},{"key":"35_CR12","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF00264612","volume":"27","author":"A. Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., and Rozenberg, G., Partial (Set) 2-Structures; Part II: State Spaces of Concurrent Systems. Acta Informatica, vol. 27 (1990) 343\u2013368.","journal-title":"Acta Informatica"},{"key":"35_CR13","unstructured":"Harrisson, M.A., Introduction to Formal Language Theory. Addison-Wesley (1978)."},{"key":"35_CR14","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/3-540-60218-6_26","volume":"962","author":"P. Jancar","year":"1995","unstructured":"Jancar, P., and Moller, F., Checking Regular Properties of Petri Nets, Proceedings Concur 95, Lecture Notes in Computer Science 962 (1995) 348\u2013362.","journal-title":"Lecture Notes in Computer Science"},{"issue":"no.4","key":"35_CR15","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. International Journal of Foundations of Computer Science, vol. 3 no. 4 (1992) 443\u2013478.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Mauw, S. and Reniers, M.A., High-level Message Sequence Charts. Proceedings of the Eighth SDL Forum, North-Holland (1997).","DOI":"10.1016\/B978-044482816-3\/50020-4"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"Rackoff, C., The Covering and Boundedness Problems for Vector Addition Systems. Theoretical Computer Science, vol. 6 (1978) 223\u2013231.","journal-title":"Theoretical Computer Science"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0022-0000(86)90006-1","volume":"32","author":"L.E. Rosier","year":"1986","unstructured":"Rosier, L.E., and Yen, H.C., A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems. Journal of Computer and System Science, vol. 32 (1986) 105\u2013135.","journal-title":"Journal of Computer and System Science"},{"key":"35_CR19","unstructured":"Schrijver, A., Theory of Linear and Integer Programming. John Wiley (1986)."}],"container-title":["Lecture Notes in Computer Science","CONCUR'98 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:28:52Z","timestamp":1555748932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648963","9783540684558"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0055646","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}