{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:28:58Z","timestamp":1775053738876,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540892861","type":"print"},{"value":"9783540892878","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89287-8_11","type":"book-chapter","created":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T21:10:04Z","timestamp":1227733804000},"page":"172-198","source":"Crossref","is-referenced-by-count":22,"title":["Directed Unfolding of Petri Nets"],"prefix":"10.1007","author":[{"given":"Blai","family":"Bonet","sequence":"first","affiliation":[]},{"given":"Patrik","family":"Haslum","sequence":"additional","affiliation":[]},{"given":"Sarah","family":"Hickmott","sequence":"additional","affiliation":[]},{"given":"Sylvie","family":"Thi\u00e9baux","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-56496-9_14","volume-title":"Computer Aided Verification","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 164\u2013177. Springer, Heidelberg (1993)"},{"issue":"2-3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(94)00019-0","volume":"23","author":"J. Esparza","year":"1994","unstructured":"Esparza, J.: Model checking using net unfoldings. Science of Computer Programming\u00a023(2-3), 151\u2013195 (1994)","journal-title":"Science of Computer Programming"},{"issue":"5","key":"11_CR3","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TAC.2003.811249","volume":"48","author":"A. Benveniste","year":"2003","unstructured":"Benveniste, A., Fabre, E., Jard, C., Haar, S.: Diagnosis of asynchronous discrete event systems, a net unfolding approach. IEEE Trans. on Automatic Control\u00a048(5), 714\u2013727 (2003)","journal-title":"IEEE Trans. on Automatic Control"},{"key":"11_CR4","first-page":"1904","volume-title":"Proc. of 20th Int. Joint Conference on Artificial Intelligence","author":"S. Hickmott","year":"2007","unstructured":"Hickmott, S., Rintanen, J., Thi\u00e9baux, S., White, L.: Planning via Petri net unfolding. In: Proc. of 20th Int. Joint Conference on Artificial Intelligence, pp. 1904\u20131911. AAAI Press, Menlo Park (2007)"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"20","author":"J. Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. Formal Methods in System Design\u00a020(3), 285\u2013310 (2002)","journal-title":"Formal Methods in System Design"},{"key":"11_CR6","first-page":"1","volume":"46","author":"J. Esparza","year":"2001","unstructured":"Esparza, J., Schr\u00f6ter, C.: Unfolding based algorithms for the reachability problem. Fundamentia Informatica\u00a046, 1\u201317 (2001)","journal-title":"Fundamentia Informatica"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Esparza, J., Kanade, P., Schwoon, S.: A negative result on depth first unfolding. Software Tools for Technology Transfer (2007)","DOI":"10.1007\/s10009-007-0030-5"},{"issue":"1-2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","volume":"129","author":"B. Bonet","year":"2001","unstructured":"Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence\u00a0129(1-2), 5\u201333 (2001)","journal-title":"Artificial Intelligence"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: fast plan generation through heuristic search. Journal of Artificial Intelligence Research\u00a014, 253\u2013302 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1-2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0004-3702(99)00010-7","volume":"109","author":"D. McDermott","year":"1999","unstructured":"McDermott, D.: Using regression-match graphs to control search in planning. Artificial Intelligence\u00a0109(1-2), 111\u2013159 (1999)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proceedings of the IEEE\u00a077(4), 541\u2013580 (1989)","journal-title":"Proceedings of the IEEE"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ipl.2007.06.002","volume":"104","author":"T. Chatain","year":"2007","unstructured":"Chatain, T., Khomenko, V.: On the well-foundedness of adequate orders used for construction of complete unfolding prefixes. Information Processing Letters\u00a0104, 129\u2013136 (2007)","journal-title":"Information Processing Letters"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/3-540-44685-0_25","volume-title":"CONCUR 2001 - Concurrency Theory","author":"V. Khomenko","year":"2001","unstructured":"Khomenko, V., Koutny, M.: Towards an efficient algorithm for unfolding Petri nets. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 366\u2013380. Springer, Heidelberg (2001)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-57529-4_66","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Cheng","year":"1993","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. In: Shyamasundar, R.K. (ed.) FSTTCS 1993. LNCS, vol.\u00a0761, pp. 326\u2013337. Springer, Heidelberg (1993)"},{"key":"11_CR15","unstructured":"Melzer, S.: Verifikation Verteilter Systeme Mittels Linearer\u2013und Constraint-Programmierung. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (1998)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-49059-0_17","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"K. Heljanko","year":"1999","unstructured":"Heljanko, K.: Using Logic Programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 240\u2013254. Springer, Heidelberg (1999)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-44618-4_30","volume-title":"CONCUR 2000 - Concurrency Theory","author":"V. Khomenko","year":"2000","unstructured":"Khomenko, V., Koutny, M.: LP deadlock checking using partial order dependencies. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 410\u2013425. Springer, Heidelberg (2000)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45139-0_5","volume-title":"Model Checking Software","author":"S. Edelkamp","year":"2001","unstructured":"Edelkamp, S., Lluch-Lafuente, A., Leue, S.: Directed explicit model checking with HSF-SPIN. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol.\u00a02057, pp. 57\u201379. Springer, Heidelberg (2001)"},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00236-003-0122-y","volume":"40","author":"V. Khomenko","year":"2003","unstructured":"Khomenko, V., Koutny, M., Vogler, W.: Canonical prefixes of Petri net unfoldings. Acta Informatica\u00a040(2), 95\u2013118 (2003)","journal-title":"Acta Informatica"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","first-page":"13","volume-title":"Proc. 6th European Conf. on Planning","author":"S. Edelkamp","year":"2001","unstructured":"Edelkamp, S.: Planning with pattern databases. In: Proc. 6th European Conf. on Planning. LNCS, pp. 13\u201324. Springer, Heidelberg (2001)"},{"key":"11_CR21","unstructured":"Haslum, P., Bonet, B., Geffner, H.: New admissible heuristics for domain-independent planning. In: Proc. 20th National Conf. on Artificial Intelligence, pp. 1163\u20131168. AAAI Press \/ MIT Press (2005)"},{"key":"11_CR22","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"J. Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading (1984)"},{"issue":"1-2","key":"11_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T. Bylander","year":"1994","unstructured":"Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence\u00a069(1-2), 165\u2013204 (1994)","journal-title":"Artificial Intelligence"},{"key":"11_CR24","first-page":"140","volume-title":"Proc. 6th International Conf. on Artificial Intelligence Planning and Scheduling","author":"P. Haslum","year":"2000","unstructured":"Haslum, P., Geffner, H.: Admissible heuristic for optimal planning. In: Proc. 6th International Conf. on Artificial Intelligence Planning and Scheduling, Breckenridge, CO, pp. 140\u2013149. AAAI Press, Menlo Park (2000)"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Corbett, J.C.: Evaluating deadlock detection methods for concurrent software. IEEE Trans. on Software Engineering\u00a022(3) (1996)","DOI":"10.1109\/32.489078"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1016\/S0305-0548(01)00054-5","volume":"29","author":"A. Linhares","year":"2002","unstructured":"Linhares, A., Yanasse, H.H.: Connection between cutting-pattern sequencing, VLSI design and flexible machines. Computers & Operations Research\u00a029, 1759\u20131772 (2002)","journal-title":"Computers & Operations Research"},{"issue":"2","key":"11_CR27","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2005.07.023","volume":"149","author":"S. Edelkamp","year":"2006","unstructured":"Edelkamp, S., Jabbar, S.: Action planning for directed model checking of Petri nets. Electronic Notes Theoretical Computer Science\u00a0149(2), 3\u201318 (2006)","journal-title":"Electronic Notes Theoretical Computer Science"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BFb0055644","volume-title":"CONCUR \u201998 Concurrency Theory","author":"W. Vogler","year":"1998","unstructured":"Vogler, W., Semenov, A., Yakovlev, A.: Unfolding and finite prefix for nets with read arcs. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 501\u2013516. Springer, Heidelberg (1998)"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/3-540-36577-X_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"V. Khomenko","year":"2003","unstructured":"Khomenko, V., Koutny, M.: Branching processes of high-level Petri nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 458\u2013472. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency I"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89287-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T15:45:03Z","timestamp":1557935103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89287-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540892861","9783540892878"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89287-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}