{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T10:11:29Z","timestamp":1768817489331,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540687450","type":"print"},{"value":"9783540687467","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68746-7_10","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:37:54Z","timestamp":1217471874000},"page":"92-111","source":"Crossref","is-referenced-by-count":19,"title":["A Symbolic Algorithm for the Synthesis of Bounded Petri Nets"],"prefix":"10.1007","author":[{"given":"J.","family":"Carmona","sequence":"first","affiliation":[]},{"given":"J.","family":"Cortadella","sequence":"additional","affiliation":[]},{"given":"M.","family":"Kishinevsky","sequence":"additional","affiliation":[]},{"given":"A.","family":"Kondratyev","sequence":"additional","affiliation":[]},{"given":"L.","family":"Lavagno","sequence":"additional","affiliation":[]},{"given":"A.","family":"Yakovlev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-59293-8_207","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. 364\u2013383. Springer, Heidelberg (1995)"},{"key":"10_CR2","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.) Lectures on Petri Nets I: Basic Models. LNCS, vol.\u00a01491, pp. 529\u2013586. Springer, Heidelberg (1998)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-75183-0_27","volume-title":"Business Process Management","author":"R. Bergenthum","year":"2007","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Process mining based on regions of languages. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol.\u00a04714, pp. 375\u2013383. Springer, Heidelberg (2007)"},{"issue":"8","key":"10_CR4","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computer-Aided Design\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"10_CR5","unstructured":"Caillaud, B.: Synet: A synthesizer of distributable bounded Petri-nets from finite automata (2002), \n                    \n                      http:\/\/www.irisa.fr\/s4\/tools\/synet\/"},{"key":"10_CR6","volume-title":"Model Checking","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)"},{"issue":"8","key":"10_CR7","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":"10_CR8","volume-title":"ACSD","author":"P. Darondeau","year":"2007","unstructured":"Darondeau, P.: Synthesis and control of asynchronous and distributed systems. In: Basten, T., Juh\u00e1s, G., Shukla, S.K. (eds.) ACSD. IEEE Computer Society, Los Alamitos (2007)"},{"issue":"4","key":"10_CR9","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(4), 297\u2013315 (1996)","journal-title":"Acta Informatica"},{"key":"10_CR10","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, II. Acta Informatica\u00a027, 315\u2013368 (1990)","journal-title":"Acta Informatica"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1006\/inco.1995.1032","volume":"117","author":"P.W. Hoogers","year":"1995","unstructured":"Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: A trace semantics for petri nets. Inf. Comput.\u00a0117(1), 98\u2013114 (1995)","journal-title":"Inf. Comput."},{"issue":"1&2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(95)00120-4","volume":"153","author":"P.W. Hoogers","year":"1996","unstructured":"Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: An event structure semantics for general petri nets. Theor. Comput. Sci.\u00a0153(1&2), 129\u2013170 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","first-page":"279","volume-title":"Advances in Petri Nets","author":"A.W. Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.W.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255, pp. 279\u2013324. Springer, Heidelberg (1987)"},{"key":"10_CR14","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"issue":"4","key":"10_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. Int. Journal of Foundations of Computer Science\u00a03(4), 443\u2013478 (1992)","journal-title":"Int. Journal of Foundations of Computer Science"},{"issue":"6","key":"10_CR16","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/TCAD.2006.884416","volume":"26","author":"D. Sokolov","year":"2007","unstructured":"Sokolov, D., Bystrov, A., Yakovlev, A.: Direct mapping of low-latency asynchronous controllers from STGs. IEEE Transactions on Computer-Aided Design\u00a026(6), 993\u20131009 (2007)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"10_CR17","unstructured":"Verbeek, H.M.W., Pretorius, A.J., van der Aalst, W.M.P., van Wijk, J.J.: On Petri-net synthesis and attribute-based visualization. In: Proc. Workshop on Petri Nets and Software Engineering (PNSE 2007), pp. 127\u2013141 (June 2007)"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68746-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T05:22:38Z","timestamp":1551504158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68746-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540687450","9783540687467"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68746-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}