{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:12Z","timestamp":1725493572754},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434191"},{"type":"electronic","value":"9783540460022"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46002-0_26","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:59Z","timestamp":1193552999000},"page":"371-385","source":"Crossref","is-referenced-by-count":19,"title":["Parallelisation of the Petri Net Unfolding Algorithm"],"prefix":"10.1007","author":[{"given":"Keijo","family":"Heljanko","sequence":"first","affiliation":[]},{"given":"Victor","family":"Khomenko","sequence":"additional","affiliation":[]},{"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"26_CR1","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":"26_CR2","unstructured":"E. M. Clarke, O. Grumberg, and D. Peled: Model Checking. MIT Press (1999)."},{"key":"26_CR3","unstructured":"J. C. Corbett: Evaluating Deadlock Detection Methods. University of Hawaii at Manoa (1994)."},{"key":"26_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 Informatica 28 (1991) 575\u2013591.","journal-title":"Acta Informatica"},{"key":"26_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-48320-9_2","volume-title":"An Unfolding Algorithm for Synchronous Products of Transition Systems","author":"J. Esparza","year":"1999","unstructured":"J. Esparza and S. R\u00f6mer: An Unfolding Algorithm for Synchronous Products of Transition Systems. Proc. of CONCUR\u201999, Springer-Verlag, Lecture Notes in Computer Science 1664 (1999) 2\u201320."},{"key":"26_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61042-1_40","volume-title":"Proc. of TACAS\u201996","author":"J. Esparza","year":"1996","unstructured":"J. Esparza, S. R\u00f6mer and W. Vogler: An Improvement of McMillan\u2019s Unfolding Algorithm. Proc. of TACAS\u201996, Margaria T., Steffen B. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1055 (1996) 87\u2013106."},{"key":"26_CR7","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":"26_CR8","unstructured":"J. Esparza and C. Schr\u00f6ter: Reachability Analysis Using Net Unfoldings. Proc. of Workshop of Concurrency, Specification & Programming 2000 (CS&P\u20192000), H. D. Burkhard, L. Czaja, A. Skowron, and P. Starke, (Eds.). Informatik-Bericht 140, vol. 2. Humboldt-Universitat zu Berlin (2000) 255\u2013270."},{"key":"26_CR9","unstructured":"K. Heljanko: Minimizing Finite Complete Prefixes. Proc. of Workshop Concurrency, Specification and Programming 1999 (CS&P\u201999), (1999) 83\u201395."},{"key":"26_CR10","series-title":"Technical Report","volume-title":"Deadlock and Reachability Checking with Finite Complete Prefixes","author":"K. Heljanko","year":"1999","unstructured":"K. Heljanko: Deadlock and Reachability Checking with Finite Complete Prefixes. Technical Report A56, Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland (1999)."},{"issue":"3","key":"26_CR11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3233\/FI-1999-37304","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. Fundamentae Informaticae 37(3) (1999) 247\u2013268.","journal-title":"Fundamentae Informaticae"},{"key":"26_CR12","unstructured":"K. Heljanko, V. Khomenko and M. Koutny: Parallelisation of the Petri Net Unfolding Algorithm. Technical Report CS-TR-733, Department of Computing Science, University of Newcastle (2001)."},{"key":"26_CR13","unstructured":"V. Khomenko and M. Koutny: Verification of Bounded Petri Nets Using Integer Programming. Technical Report CS-TR-711, Department of Computing Science, University of Newcastle (2000)."},{"key":"26_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/3-540-44618-4_30","volume-title":"Proc. of CONCUR\u20192000","author":"V. Khomenko","year":"2000","unstructured":"V. Khomenko and M. Koutny: LP Deadlock Checking Using Partial Order Dependencies. Proc. of CONCUR\u20192000, Palamidessi C. (Ed.). Springer-Verlag, Lecture Notes in Computer Science 1877 (2000) 410\u2013425."},{"key":"26_CR15","unstructured":"V. Khomenko and M. Koutny: An Efficient Algorithm for Unfolding Petri Nets. Technical Report CS-TR-726, Department of Computing Science, University of Newcastle (2001)."},{"key":"26_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/3-540-44685-0_25","volume-title":"Proc. of CONCUR\u20192001","author":"V. Khomenko","year":"2001","unstructured":"V. Khomenko and M. Koutny: Towards An Efficient Algorithm for Unfolding Petri Nets. Proc. of CONCUR\u20192001, Larsen P.G., Nielsen M. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 2154 (2001) 366\u2013380."},{"key":"26_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/3-540-56496-9_14","volume-title":"Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits","author":"K. L. McMillan","year":"1993","unstructured":"K. L. McMillan: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. Proc. of 4th CAV, Springer-Verlag, Lecture Notes in Computer Science 663 (1992) 164\u2013174."},{"key":"26_CR18","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":"26_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/3-540-63166-6_35","volume-title":"Proc. of Computer Aided Verification (CAV\u201997)","author":"S. Melzer","year":"1997","unstructured":"S. Melzer and S. R\u00f6mer: Deadlock Checking Using Net Unfoldings. Proc. of Computer Aided Verification (CAV\u201997), O. Grumberg (Ed.). Springer-Verlag, Lecture Notes in Computer Science 1254 (1997) 352\u2013363."},{"key":"26_CR20","unstructured":"W. Vogler, V. Khomenko, and M. Koutny: Canonical Prefixes of Petri Net Unfoldings. Technical Report CS-TR-741, Department of Computing Science, University of Newcastle (2001)."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46002-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T17:34:02Z","timestamp":1588008842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46002-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434191","9783540460022"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-46002-0_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}