{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:40:42Z","timestamp":1757540442886},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223429"},{"type":"electronic","value":"9783540278139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27813-9_9","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T04:57:57Z","timestamp":1284440277000},"page":"109-121","source":"Crossref","is-referenced-by-count":6,"title":["Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings"],"prefix":"10.1007","author":[{"given":"Claus","family":"Schr\u00f6ter","sequence":"first","affiliation":[]},{"given":"Victor","family":"Khomenko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Best, E., Fleischhack, H., Fraczak, W., Hopkins, R., Klaudel, H., Pelz, E.: An M-net Semantics of B( PN) 2. In: Proc. of STRICT 1995, Berlin, pp. 85\u2013100 (1995)","DOI":"10.1007\/978-1-4471-3078-9_6"},{"key":"9_CR2","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/3-540-45022-X_40","volume-title":"Automata, Languages and Programming","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Heljanko, K.: A new unfolding approach to LTL model checking. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 475\u2013486. Springer, Heidelberg (2000)"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/32.489078","volume":"22","author":"J.C. Corbett","year":"1996","unstructured":"Corbett, J.C.: Evaluating Deadlock Detection Methods for Concurrent Software. IEEE Transactions on Software Engineering\u00a022(3), 161\u2013180 (1996)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-45139-0_4","volume-title":"Model Checking Software","author":"J. Esparza","year":"2001","unstructured":"Esparza, J., Heljanko, K.: Implementing LTL model checking with net unfoldings. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol.\u00a02057, pp. 37\u201356. Springer, Heidelberg (2001)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61042-1_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Esparza","year":"1996","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An Improvement of McMillan\u2019s Unfolding Algorithm. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 87\u2013106. Springer, Heidelberg (1996) ;Full version: FMSD 20(3) ,285\u2013310 (2002)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-44798-9_25","volume-title":"Correct Hardware Design and Verification Methods","author":"J. Esparza","year":"2001","unstructured":"Esparza, J., Schr\u00f6ter, C.: Net reductions for LTL model-checking. In: Margaria, T., Melham, T.F. (eds.) CHARME 2001. LNCS, vol.\u00a02144, pp. 310\u2013324. Springer, Heidelberg (2001)"},{"issue":"3,4","key":"9_CR8","first-page":"231","volume":"47","author":"J. Esparza","year":"2001","unstructured":"Esparza, J., Schr\u00f6ter, C.: Unfolding Based Algorithms for the Reachability Problem. Fundamenta Informaticae\u00a047(3,4), 231\u2013245 (2001)","journal-title":"Fundamenta Informaticae"},{"key":"9_CR9","unstructured":"Grahlmann, B., R\u00f6mer, S., Thielke, T., Graves, B., Damm, M., Riemann, R., Jenner, L., Melzer, S., Gronewold, A.: Pep: Programming Environment Based on Petri Nets. Technical Report 14, Universit\u00e4t Hildesheim (1995)"},{"key":"9_CR10","unstructured":"Heljanko, K.: Combining Symbolic and Partial Order Methods for Model Checking 1-Safe Petri Nets. PhD thesis, Helsinki University of Technology (2002)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-46002-0_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Heljanko","year":"2002","unstructured":"Heljanko, K., Khomenko, V., Koutny, M.: Parallelisation of the petri net unfolding algorithm. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 371\u2013385. Springer, Heidelberg (2002)"},{"key":"9_CR12","volume-title":"The Spin Model Checker","author":"G.J. Holzmann","year":"2003","unstructured":"Holzmann, G.J.: The Spin Model Checker. Addison-Wesley, Reading (2003)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. PhD Thesis, School of Computing Science, University of Newcastle upon Tyne (2003)","DOI":"10.1007\/s00236-003-0122-y"},{"key":"9_CR14","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":"9_CR15","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)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-45657-0_49","volume-title":"Computer Aided Verification","author":"V. Khomenko","year":"2002","unstructured":"Khomenko, V., Koutny, M., Vogler, W.: Canonical prefixes of petri net unfoldings. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 95\u2013118. Springer, Heidelberg (2002)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 State Explosion Problem in the Verification of Asynchronous Circuits. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 164\u2013174. Springer, Heidelberg (1993)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/3-540-63166-6_35","volume-title":"Computer Aided Verification","author":"S. Melzer","year":"1997","unstructured":"Melzer, S., R\u00f6mer, S.: Deadlock Checking Using Net Unfoldings. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 352\u2013363. Springer, Heidelberg (1997)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from One, One for All \u2014 on Model Checking Using Representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"9_CR20","unstructured":"R\u00f6mer, S.: Entwicklung und Implementierung von Verifikationstechniken auf der Basis von Netzentfaltungen. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (2000)"},{"key":"9_CR21","unstructured":"Vardi, M.Y., Wolper, P.: An Automata Theoretic Approach to Automatic Program Verification. In: Proc. of LICS 1986, pp. 322\u2013331. Cambridge (1986)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BFb0028746","volume-title":"Computer Aided Verification","author":"F. Wallner","year":"1998","unstructured":"Wallner, F.: Model Checking LTL Using Net Unfoldings. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 207\u2013218. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27813-9_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:22:07Z","timestamp":1605759727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27813-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223429","9783540278139"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27813-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}