{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:40Z","timestamp":1761597040886},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424970"},{"type":"electronic","value":"9783540446859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44685-0_25","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:16:21Z","timestamp":1186726581000},"page":"366-380","source":"Crossref","is-referenced-by-count":29,"title":["Towards an Efficient Algorithm for Unfolding Petri Nets"],"prefix":"10.1007","author":[{"given":"Victor","family":"Khomenko","sequence":"first","affiliation":[]},{"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,22]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"A. Bystrov, D. J. Kinniment and A. Yakovlev: Priority Arbiters. Proc. ASYNC 2000, IEEE Computer Society Press (2000) 128\u2013137.","DOI":"10.1109\/ASYNC.2000.836990"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. M. Clarke","year":"1986","unstructured":"E. M. Clarke, E. A. Emerson and A. P. Sistla: Automatic Verification of Finite-state Concurrent Systems Using Temporal Logic Specifications. ACM TOPLAS 8 (1986) 244\u2013263.","journal-title":"ACM TOPLAS"},{"key":"25_CR3","unstructured":"J. C. Corbett: Evaluating Deadlock Detection Methods. Univ. of Hawaii at Manoa (1994)."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet: Branching processes of Petri Nets. Acta Inf. 28 (1991) 575\u2013591.","journal-title":"Acta Inf."},{"key":"25_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J. Esparza","year":"1998","unstructured":"J. Esparza: Decidability and Complexity of Petri Net Problems \u2014 An Introduction. Lectures on Petri Nets I: Basic Models Springer, LNCS 1491 (1998) 374\u2013428."},{"key":"25_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-48320-9_2","volume-title":"Proc. CONCUR\u201999","author":"J. Esparza","year":"1999","unstructured":"J. Esparza and S. R\u00f6mer: An Unfolding Algorithm for Synchronous Products of Transition Systems. Proc. CONCUR\u201999, Springer, LNCS 1664 (1999) 2\u201320."},{"key":"25_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61042-1_40","volume-title":"Proc. TACAS\u201996","author":"J. Esparza","year":"1996","unstructured":"J. Esparza, S. R\u00f6mer and W. Vogler: An Improvement of McMillan\u2019s Unfolding Algorithm. Proc. TACAS\u201996, Springer, LNCS 1055 (1996) 87\u2013106."},{"key":"25_CR8","unstructured":"J. Esparza, S. R\u00f6mer and W. Vogler: An Improvement of McMillan\u2019s Unfolding Algorithm. Formal Methods in System Design (2001) to appear."},{"key":"25_CR9","unstructured":"K. Heljanko: Minimizing Finite Complete Prefixes. Proc. CS&P\u201999 (1999) 83\u201395."},{"key":"25_CR10","volume-title":"Report A56","author":"K. Heljanko","year":"1999","unstructured":"K. Heljanko: Deadlock and Reachability Checking with Finite Complete Prefixes. Report A56, Laboratory for Theoretical Computer Science, HUT, Espoo (1999)."},{"key":"25_CR11","first-page":"247","volume":"37","author":"K. Heljanko","year":"1999","unstructured":"K. Heljanko: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. Fund. Inf. 37 (1999) 247\u2013268.","journal-title":"Fund. Inf."},{"key":"25_CR12","unstructured":"V. Khomenko and M. Koutny: Verification of Bounded Petri Nets Using Integer Programming. CS-TR-711, Dept. of Computing Science, Univ. of Newcastle (2000)."},{"key":"25_CR13","unstructured":"V. Khomenko and M. Koutny: An Efficient Algorithm for Unfolding Petri Nets. CS-TR-726, Dept. of Computing Science, Univ. of Newcastle (2001)."},{"key":"25_CR14","series-title":"Lect Notes Comput Sci","first-page":"164","volume-title":"Proc. CAV\u201992","author":"K. L. McMillan","year":"1992","unstructured":"K. L. McMillan: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. Proc. CAV\u201992, Springer, LNCS 663 (1992) 164\u2013174."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"K.L. McMillan: Symbolic Model Checking. PhD thesis, CMU-CS-92-131 (1992).","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"25_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/3-540-63166-6_35","volume-title":"Proc. CAV\u201997","author":"S. Melzer","year":"1997","unstructured":"S. Melzer and S. R\u00f6mer: Deadlock Checking Using Net Unfoldings. Proc. CAV\u201997, Springer, LNCS 1254 (1997) 352\u2013363."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2001 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44685-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:11:29Z","timestamp":1556734289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44685-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424970","9783540446859"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44685-0_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}