{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:25:45Z","timestamp":1725488745234},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421245"},{"type":"electronic","value":"9783540451396"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45139-0_11","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:39:56Z","timestamp":1186742396000},"page":"183-191","source":"Crossref","is-referenced-by-count":4,"title":["p2b: A translation utility for linking promela and symbolic model checking (tool paper)"],"prefix":"10.1007","author":[{"given":"Michael","family":"Baldamus","sequence":"first","affiliation":[]},{"given":"Jochen","family":"Schr\u00f6der-Babo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, R. Brayton, T. Henzinger, S. Qadeer, and S. Rajmani. Partial-Order Reduction in Symbolic State Space Exploration. In Computer-Aided Verification, pages 340\u2013351. Springer-Verlag, 1997. Proceedings CAV\u2019 97.","DOI":"10.1007\/3-540-63166-6_34"},{"key":"11_CR2","unstructured":"M. Baldamus and K Schneider. The BDD Space Complexity of Different Forms of Concurrency, 2001. Accepted for ICACSD\u2019 01."},{"issue":"8","key":"11_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677\u2013691, 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR4","unstructured":"J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang. Symbolic Model Checking: 1020 States and Beyond. In Logic in Computer Science, pages 1\u201333. IEEE Computer Society Press, 1990. Proceedings LICS\u2019 90 symposium."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"D. Dill, A. Drexler, A. Hu, and C. Han Yang. Protocol Verification as a Hardware Design Aid. In Computer Design: VLSI in Computers and Processors, pages 522\u2013525, 1992. IEEE Conference Proceedings.","DOI":"10.1109\/ICCD.1992.276232"},{"key":"11_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-54194-2","volume-title":"Computer-Aided Verification","author":"R. Enders","year":"1991","unstructured":"R. Enders, T. Filkorn, and D. Taubner. Generating BDDs for Symbolic Model Checking in CCS. In Computer-Aided Verification, LNCS 575, pages 203\u2013213. Springer-Verlag, 1991. Proceedings CAV\u2019 91 conference."},{"key":"11_CR7","unstructured":"G. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991."},{"key":"11_CR8","first-page":"279","volume":"23","author":"G. Holzmann","year":"1997","unstructured":"G. Holzmann. The Model Checker SPIN. IEEE Transactions on Computer Engineering, 23:279\u2013295, 1997.","journal-title":"IEEE Transactions on Computer Engineering"},{"key":"11_CR9","series-title":"Lect Notes Comput Sci","first-page":"345","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. R","year":"1998","unstructured":"Kurshan, R. and Levin, V. and Peled, D. and Yenig\u00fcn, H. Static Partial Order Reduction. In Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1384, pages 345\u2013357. Springer-Verlag, 1998. Proceedings TACAS\u2019 98 conference."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"K. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3190-6"}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45139-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T20:26:21Z","timestamp":1550780781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45139-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421245","9783540451396"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45139-0_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}