{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:22:52Z","timestamp":1761488572006,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_8","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"112-126","source":"Crossref","is-referenced-by-count":5,"title":["Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bourdeaud\u2019huy","sequence":"first","affiliation":[]},{"given":"Said","family":"Hanafi","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Yim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Benasser, A.: L\u2019accessibilit\u00e9 dans les r\u00e9seaux de Petri: une approche bas\u00e9e sur la programmation par contraintes. PhD thesis, Universit\u00e9 des sciences et technologies de Lille (2000)"},{"issue":"8-9","key":"8_CR2","first-page":"959","volume":"33","author":"A. Benasser","year":"1999","unstructured":"Benasser, A., Yim, P.: Railway traffic planning with petri nets and constraint programming. JESA\u00a033(8-9), 959\u2013975 (1999)","journal-title":"JESA"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","first-page":"359","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"G. Berthelot","year":"1986","unstructured":"Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0254, pp. 359\u2013376. Springer, Heidelberg (1986)"},{"key":"8_CR4","unstructured":"Bourdeaud\u2019huy, T., Hanafi, S., Yim, P.: R\u00e9solution du probl\u00e8me d\u2019accessibilit\u00e9 dans les r\u00e9seaux de Petri par l\u2019abstraction logique et la programmation math\u00e9matique. Technical report, L.A. G. I. S., Ecole Centrale de Lille (2004)"},{"key":"8_CR5","unstructured":"Briand, C.: Solving the car-sequencing problem using petri nets. In: International Conference on Industrial Engineering and Production Management, vol. 1, pp. 543\u2013551 (1999)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Fernandez, J.-C., Jard, C., J\u00e9ron, T., Mounier, L.: \u201con the fly\u201d verification of finite transition systems. Formal Methods in System Design (1992)","DOI":"10.1007\/978-1-4615-3556-0_4"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Gunnarsson, J.: Symbolic tools for verification of large scale DEDS. In: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics (SMC 1998), San Diego, CA, October 11-14, pp. 722\u2013727 (1998)","DOI":"10.1109\/ICSMC.1998.725499"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/3-540-15204-0_13","volume-title":"Advances in Petri Nets 1984","author":"P. Huber","year":"1985","unstructured":"Huber, P., Jensen, A.M., Jepsen, L.O., Jensen, K.: Towards reachability trees for high-level petri nets. In: Rozenberg, G. (ed.) APN 1984. LNCS, vol.\u00a0188, pp. 215\u2013233. Springer, Heidelberg (1985)"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/129393.129398","volume":"14","author":"J. Jaffar","year":"1992","unstructured":"Jaffar, J., Michaylov, Stuckey, P., Yap, R.: The clp(r) language and system. ACM Transactions on Programming Languages and Systems\u00a014(3), 339\u2013395 (1992)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"7","key":"8_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R.M. Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Comm. of the ACM\u00a019(7), 371\u2013384 (1976)","journal-title":"Comm. of the ACM"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability and reachability in vector addition systems. In: Proc. of the 14th Annual ACM Symp. on Theory of Computing, pp. 267\u2013281 (1982)","DOI":"10.1145\/800070.802201"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-540-47919-2_7","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"K. Lautenbach","year":"1987","unstructured":"Lautenbach, K.: Linear algebraic techniques for place\/transition nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0254, pp. 142\u2013167. Springer, Heidelberg (1987)"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1109\/70.282537","volume":"10","author":"D.Y. Lee","year":"1994","unstructured":"Lee, D.Y., DiCesare, F.: Scheduling flexible manufacturing systems using petri nets and heuristic search. IEEE Transactions on Robotics and Automation\u00a010(2), 123\u2013132 (1994)","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-56689-9_49","volume-title":"Advances in Petri Nets 1993","author":"M. Lindqvist","year":"1993","unstructured":"Lindqvist, M.: Parameterized reachability trees for predicate\/transition nets. In: Rozenberg, G. (ed.) APN 1993. LNCS, vol.\u00a0674, pp. 301\u2013324. Springer, Heidelberg (1993)"},{"key":"8_CR15","unstructured":"Lipton, R.: The reachability problem requires exponential space. Technical report, Computer Science Dept., Yale University (1976)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Murata, T.: Petri nets: properties, analysis ans applications. In: Proceedings of the IEEE, vol. 77, pp. 541\u2013580 (1989)","DOI":"10.1109\/5.24143"},{"key":"8_CR17","volume-title":"Discrete Optimization","author":"R.G. Parker","year":"1988","unstructured":"Parker, R.G., Rardin, R.L.: Discrete Optimization. Academic Press, London (1988)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol.\u00a0483, pp. 491\u2013515. Springer, Heidelberg (1991)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Vernadat, F., Az\u00e9ma, P., Michel, P.: Covering steps graphs. In: 17 th Int. Conf on Application and Theory of Petri Nets 1996 (1996)","DOI":"10.1007\/3-540-61363-3_28"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T04:19:36Z","timestamp":1740629976000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}