{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:04:32Z","timestamp":1781280272527,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540222613","type":"print"},{"value":"9783540277552","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27755-2_11","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T03:48:13Z","timestamp":1284436093000},"page":"413-438","source":"Crossref","is-referenced-by-count":20,"title":["Unbounded Petri Net Synthesis"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Darondeau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"CONCUR\u201999. Concurrency Theory","author":"R. Alur","year":"1999","unstructured":"Alur, R., Yannakakis, M.: Model Checking of Message Sequence Charts. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 114\u2013129. Springer, Heidelberg (1999)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","first-page":"647","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"E. Badouel","year":"1995","unstructured":"Badouel, E., Bernardinello, L., Darondeau, P.: Polynomial Algorithms for the Synthesis of Bounded Nets. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol.\u00a0915, pp. 647\u2013679. Springer, Heidelberg (1995)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(96)00219-8","volume":"186","author":"E. Badouel","year":"1997","unstructured":"Badouel, E., Bernardinello, L., Darondeau, P.: The Synthesis Problem for Elementary Net Systems is NP-complete. Theoretical Computer Science\u00a0186, 107\u2013134 (1997)","journal-title":"Theoretical Computer Science"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s001650200022","volume":"13","author":"E. Badouel","year":"2002","unstructured":"Badouel, E., Caillaud, B., Darondeau, P.: Distributing finite automata through Petri net synthesis. Formal Aspects of Computing\u00a013, 447\u2013470 (2002)","journal-title":"Formal Aspects of Computing"},{"key":"11_CR5","unstructured":"Badouel, E.: Darondeau, P.: On the Synthesis of General Petri Nets. Inria Research Report 3025 (1996)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/3-540-65306-6_22","volume-title":"Lectures on Petri Nets I: Basic Models","author":"E. Badouel","year":"1998","unstructured":"Badouel, E., Darondeau, P.: Theory of regions. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 529\u2013586. Springer, Heidelberg (1998)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Badouel, E.: Darondeau, P.: The Synthesis of Petri Nets from Path-Automatic Specifications, draft (2003) (submitted)","DOI":"10.1016\/j.ic.2004.04.004"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-45541-8_11","volume-title":"Unifying Petri Nets","author":"M. Bednarczyk","year":"2001","unstructured":"Bednarczyk, M., Borzyszkowski, A.: On Concurrent Realization of Reactive Systems and their Morphisms. In: Ehrig, H., Juh\u00e1s, G., Padberg, J., Rozenberg, G. (eds.) APN 2001. LNCS, vol.\u00a02128, pp. 346\u2013379. Springer, Heidelberg (2001)"},{"key":"11_CR9","first-page":"11","volume-title":"Structures in Concurrency Theory, Workshops on Computing","author":"L. Bernardinello","year":"1996","unstructured":"Bernardinello, L., De Michelis, G., Petruni, K., Vigna, S.: On the Synchronic Sructure of Transition Systems. In: Desel, J. (ed.) Structures in Concurrency Theory, Workshops on Computing, pp. 11\u201331. Springer, Heidelberg (1996)"},{"key":"11_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J. Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner Verlag, Stuttgart (1979)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","first-page":"11","volume-title":"Application and Theory of Petri Nets 1993","author":"L. Bernardinello","year":"1993","unstructured":"Bernardinello, L.: Synthesis of Net Systems. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol.\u00a0691, pp. 11\u201331. Springer, Heidelberg (1993)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/S0304-3975(02)00046-4","volume":"290","author":"L. Bernardinello","year":"2003","unstructured":"Bernardinello, L., Ferrigato, C., Pomello, L.: An Algebraic Model of Observable Properties in Distributed Systems. Theoretical Computer Science\u00a0290, 637\u2013678 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(94)00030-1","volume":"135","author":"F. Bracho","year":"1994","unstructured":"Bracho, F., Droste, M.: Labelled Domains and Automata with Concurrency Relations. Theoretical Computer Science\u00a0135(2), 289\u2013318 (1994)","journal-title":"Theoretical Computer Science"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45510-8_5","volume-title":"Modeling and Verification of Parallel Processes","author":"B. Caillaud","year":"2001","unstructured":"Caillaud, B., Darondeau, P., Helouet, L., Lesventes, G.: HMSCs as partial specifications.. with pNs as completions. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol.\u00a02067, pp. 125\u2013152. Springer, Heidelberg (2001)"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/0041-5553(65)90045-5","volume":"5","author":"N. Chernikova","year":"1965","unstructured":"Chernikova, N.: Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities. USSR Computational Mathematics and Mathematical Physics\u00a05(2), 228\u2013233 (1965)","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44988-4_1","volume-title":"Application and Theory of Petri Nets 2000","author":"J. Cortadella","year":"2000","unstructured":"Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: Hardware and Petri Nets: Application to Asynchronous Circuit Design. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 1\u201315. Springer, Heidelberg (2000)"},{"issue":"8","key":"11_CR17","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/12.707587","volume":"47","author":"J. Cortadella","year":"1998","unstructured":"Cortadella, J., Kishinevsky, M., Lavagno, L., Yakovlev, A.: Deriving Petri Nets from Finite Transition Systems. IEEE Transactions on Computers\u00a047(8), 859\u2013882 (1998)","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/BFb0055646","volume-title":"CONCUR \u201998 Concurrency Theory","author":"P. Darondeau","year":"1998","unstructured":"Darondeau, P.: Deriving Petri Nets from Formal Languages. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 533\u2013548. Springer, Heidelberg (1998)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/S0304-3975(00)00162-6","volume":"258","author":"P. Darondeau","year":"2001","unstructured":"Darondeau, P.: On the Petri net realization of context-free graphs. Theoretical Computer Science\u00a0258, 573\u2013598 (2001)","journal-title":"Theoretical Computer Science"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s002360050046","volume":"33","author":"J. Desel","year":"1996","unstructured":"Desel, J., Reisig, W.: The Synthesis Problem of Petri Nets. Acta Informatica\u00a033, 297\u2013315 (1996)","journal-title":"Acta Informatica"},{"key":"11_CR21","unstructured":"Droste, M., Shortt, R.M.: Petri Nets and Automata with Concurrency Relations - an Adjunction. In: Droste, M., Gurevich, Y. (eds.) Semantics of Programming Languages and Model Theory, pp. 69\u201387 (1993)"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00264611","volume":"27","author":"A. Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures; Part I: Basic Notions and the Representation Problem. Acta Informatica\u00a027, 315\u2013342 (1990)","journal-title":"Acta Informatica"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF00264612","volume":"27","author":"A. Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures; Part II: State Spaces of Concurrent Systems. Acta Informatica\u00a027, 343\u2013368 (1990)","journal-title":"Acta Informatica"},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002360050074","volume":"34","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Decidability of model-checking for infinite-state concurrent systems. Acta Informatica\u00a034(2), 85\u2013107 (1997)","journal-title":"Acta Informatica"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/PL00013312","volume":"37","author":"H. Fernau","year":"2001","unstructured":"Fernau, H.: Parallel Communicating Grammar Systems with Terminal Transmission. Acta Informatica\u00a037, 511\u2013540 (2001)","journal-title":"Acta Informatica"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S0022-0000(68)80006-6","volume":"2","author":"P.C. Fischer","year":"1968","unstructured":"Fischer, P.C., Rosenberg, A.L.: Multitape One-Way Nonwriting Automata. Journal of Computer and System Sciences\u00a02, 88\u2013101 (1968)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR27","volume-title":"Synthesis and Control of Discrete Event Systems","author":"A. Ghaffari","year":"2002","unstructured":"Ghaffari, A., Rezg, N., Xie, X.: Live and Maximally Permissive Controller Synthesis using Theory of Regions. In: Caillaud, B., Darondeau, P., Lavagno, L., Xie, X. (eds.) Synthesis and Control of Discrete Event Systems. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded Algol-like Languages. Transactions of the American Mathematical Society, 333\u2013368 (1964)","DOI":"10.2307\/1994067"},{"key":"11_CR29","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and Languages. Pacific Journal of Mathematics\u00a016, 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematics"},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(71)80024-7","volume":"5","author":"S. Ginsburg","year":"1971","unstructured":"Ginsburg, S., Spanier, E.H.: AFL with the Semilinear Property. Journal of Computer and System Sciences\u00a05, 365\u2013396 (1971)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR31","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrisson","year":"1978","unstructured":"Harrisson, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Holzer, M., Kutrib, M.: Flip-Pushdown Automata: k+1 Pushdown Reversals are Better than k. IFIG Research Report 0206, Universitaet Giessen (2002)","DOI":"10.1007\/3-540-45061-0_40"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/3-540-55719-9_107","volume-title":"Automata, Languages and Programming","author":"P.W. Hoogers","year":"1992","unstructured":"Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: A Trace Semantics for Petri Nets. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 595\u2013604. Springer, Heidelberg (1992)"},{"key":"11_CR34","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"11_CR35","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0019-9958(70)80034-1","volume":"17","author":"O. Ibarra","year":"1970","unstructured":"Ibarra, O.: Simple Matrix Languages. Information and Control\u00a017, 359\u2013394 (1970)","journal-title":"Information and Control"},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. Mayr","year":"1984","unstructured":"Mayr, E.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal on Computing\u00a013, 441\u2013460 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"11_CR37","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\u00a03(4), 443\u2013478 (1992)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"11_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(92)90180-N","volume":"96","author":"M. Nielsen","year":"1992","unstructured":"Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary Transition Systems. Theoretical Computer Science\u00a096(1), 3\u201333 (1992)","journal-title":"Theoretical Computer Science"},{"key":"11_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BFb0039620","volume-title":"STACS 87","author":"E. Pelz","year":"1987","unstructured":"Pelz, E.: Closure Properties of Deterministic Petri Nets. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol.\u00a0247, pp. 373\u2013382. Springer, Heidelberg (1987)"},{"issue":"1","key":"11_CR40","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"P.J. Ramadge","year":"1987","unstructured":"Ramadge, P.J., Wonham, W.M.: Supervisory Control of a Class of Discrete Event Processes. SIAM Journal of Control and Optimization\u00a025(1), 206\u2013230 (1987)","journal-title":"SIAM Journal of Control and Optimization"},{"key":"11_CR41","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, Chichester (1986)"},{"key":"11_CR42","first-page":"16","volume":"28","author":"G. S\u00e9nizergues","year":"1992","unstructured":"S\u00e9nizergues, G.: Definability in weak monadic second order logic of some infinite graphs. Dagstuhl seminar on Automata theory: Infinite computations, Wadern\u00a028, 16 (1992)","journal-title":"Dagstuhl seminar on Automata theory: Infinite computations, Wadern"},{"key":"11_CR43","unstructured":"S\u00e9nizergues, G.: unpublished work communicated to the author"},{"key":"11_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-48745-X_18","volume-title":"Application and Theory of Petri Nets 1999","author":"W. Vogler","year":"1999","unstructured":"Vogler, W.: Concurrent Realization of Asynchronous Transition Systems. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol.\u00a01639, pp. 284\u2013303. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Lectures on Concurrency and Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27755-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:19:15Z","timestamp":1605759555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27755-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222613","9783540277552"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27755-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}