{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T14:41:55Z","timestamp":1759588915596},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":4460,"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":[[2001,5]]},"DOI":"10.1016\/s0304-3975(00)00162-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:02:56Z","timestamp":1027634576000},"page":"573-598","source":"Crossref","is-referenced-by-count":5,"title":["On the Petri net realization of context-free graphs"],"prefix":"10.1016","volume":"258","author":[{"given":"Philippe","family":"Darondeau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00162-6_BIB1","unstructured":"E. Badouel, Automates r\u00e9versibles et r\u00e9seaux de Petri, dualit\u00e9 et repr\u00e9sentation: le probl\u00e8me de la synth\u00e8se, Document d'habilitation, Universit\u00e9 de Rennes, 1999."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB2","first-page":"647","volume":"vol. 915","author":"Badouel","year":"1995"},{"key":"10.1016\/S0304-3975(00)00162-6_BIB3","unstructured":"E. Badouel, Ph. Darondeau, On the synthesis of general Petri nets, Inria Research Report 3025, 1996."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB4","unstructured":"C. Berge, Graphes et hypergraphes, Dunod, Paris, 1970 (English translation: Graphs and Hypergraphs, North-Holland, Amsterdam, 1973)."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB5","unstructured":"L. Bernardinello, Propri\u00e9t\u00e9s alg\u00e9briques et combinatoires des r\u00e9gions dans les graphes et leur application \u00e0 la synth\u00e8se de r\u00e9seaux, Th\u00e8se, Universit\u00e9 de Rennes, 1998."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB6","series-title":"Application des techniques de synth\u00e8se de r\u00e9seaux de Petri born\u00e9s \u00e0 la r\u00e9partition d'automates r\u00e9actifs, Proc. MSR\u201999","first-page":"373","author":"Caillaud","year":"1999"},{"key":"10.1016\/S0304-3975(00)00162-6_BIB7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","article-title":"On the regular structure of prefix rewriting","volume":"106","author":"Caucal","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(00)00162-6_BIB8","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0041-5553(65)90045-5","article-title":"Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities","volume":"5","author":"Chernikova","year":"1965","journal-title":"U.S.S.R. Comput. Math. Math. Phys."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB9","series-title":"Complete state encoding based on the theory of regions, Proc. 2nd Internat. Symp. on Advanced Research on Asynchronous Circuits and Systems","first-page":"36","author":"Cortadella","year":"1996"},{"key":"10.1016\/S0304-3975(00)00162-6_BIB10","first-page":"533","volume":"vol. 1466","author":"Darondeau","year":"1998"},{"key":"10.1016\/S0304-3975(00)00162-6_BIB11","series-title":"Semantics of Programming Languages and Model Theory","first-page":"69","article-title":"Petri nets and automata with concurrency relations \u2013 an adjunction","author":"Droste","year":"1993"},{"key":"10.1016\/S0304-3975(00)00162-6_BIB12","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00264611","article-title":"Partial (set) 2-structures; Part I","volume":"27","author":"Ehrenfeucht","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB13","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF00264612","article-title":"Partial (set) 2-structures; Part II","volume":"27","author":"Ehrenfeucht","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","article-title":"Rational sets in commutative monoids","volume":"13","author":"Eilenberg","year":"1969","journal-title":"J. Algebra"},{"key":"10.1016\/S0304-3975(00)00162-6_BIB15","first-page":"333","article-title":"Bounded algol-like languages","volume":"115","author":"Ginsburg","year":"1964","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","article-title":"Semigroups, Presburger formulas, and languages","volume":"16","author":"Ginsburg","year":"1966","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB17","unstructured":"M. Gondran, M. Minoux, Graphes et algorithmes, Eyrolles, 1979 (English translation: Graphs and Algorithms, Wiley, New York, 1984)."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB18","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"issue":"4","key":"10.1016\/S0304-3975(00)00162-6_BIB19","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. Found. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB20","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","article-title":"The theory of ends, pushdown automata, and second-order logic","volume":"37","author":"M\u00fcller","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB21","unstructured":"R.J. Parikh, Language-generating devices, Quaterly Progress Report No. 60, Research Laboratory of Electronics, Massachussets Institute of Technology, Cambridge, MA, 1961, pp. 199\u2013212."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB22","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context-free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB23","unstructured":"Ch. Reutenauer, Aspects math\u00e9matiques des r\u00e9seaux de Petri, Masson, Paris, 1979 (English translation by I. Craig: The Mathematics of Petri Nets, Prentice-Hall, Englewood Cliffs, NJ, 1990)."},{"key":"10.1016\/S0304-3975(00)00162-6_BIB24","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0304-3975(00)00162-6_BIB25","unstructured":"D.K. Wilde, A library for doing polyhedral operations, Irisa Research Report 785, 1993."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001626?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001626?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T16:28:11Z","timestamp":1555691291000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0304397500001626"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00162-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}