{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:20Z","timestamp":1763468000957},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540236108"},{"type":"electronic","value":"9783540304760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30476-0_11","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T17:51:35Z","timestamp":1294854695000},"page":"79-92","source":"Crossref","is-referenced-by-count":17,"title":["SAT-Based Verification of Safe Petri Nets"],"prefix":"10.1007","author":[{"given":"Shougo","family":"Ogata","sequence":"first","affiliation":[]},{"given":"Tatsuhiro","family":"Tsuchiya","sequence":"additional","affiliation":[]},{"given":"Tohru","family":"Kikuno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/B:FORM.0000004786.30007.f8","volume":"24","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Iyer, S.P., Nyl\u00e9n, A.: Sat-solving the coverability problem for Petri nets. Formal Methods in System Design\u00a024(1), 25\u201343 (2004)","journal-title":"Formal Methods in System Design"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(94)00231-7","volume":"147","author":"A. Cheng","year":"1995","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. Theoretical Computer Science\u00a0147(1-2), 117\u2013136 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s100090050046","volume":"2","author":"A. Cimatti","year":"2000","unstructured":"Cimatti, A., Clarke, E.M., Giunchiglia, F., Roveri, M.: NUSMV: A new symbolic model checker. International Journal on Software Tools for Technology Transfer\u00a02(4), 410\u2013425 (2000)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"11_CR5","volume-title":"Model Checking","author":"E.M. Clarke Jr.","year":"1999","unstructured":"Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/3-540-44585-4_43","volume-title":"Computer Aided Verification","author":"F. Copty","year":"2001","unstructured":"Copty, F., Fix, L., Fraer, R., Giunchiglia, E., Kamhi, G., Tacchella, A., Vardi, M.Y.: Benefits of bounded model checking at an industrial setting. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 436\u2013453. Springer, Heidelberg (2001)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"B. Grahlmann","year":"1997","unstructured":"Grahlmann, B.: The PEP Tool. In Proceedings of 9th Computer Aided Verification (CAV 1997). In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, Springer, Heidelberg (1997)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-44685-0_15","volume-title":"CONCUR 2001 - Concurrency Theory","author":"K. Heljanko","year":"2001","unstructured":"Heljanko, K.: Bounded reachability checking with process semantics. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 218\u2013232. Springer, Heidelberg (2001)"},{"issue":"4&5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1017\/S1471068403001790","volume":"3","author":"K. Heljanko","year":"2003","unstructured":"Heljanko, K., Niemel\u00e4, I.: Bounded LTL model checking with stable models. Theory and Practice of Logic Programming\u00a03(4&5), 519\u2013550 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/288548.289082","volume-title":"Proceedings of the 1998 IEEE\/ACM international conference on Computer-aided design","author":"P.-H. Ho","year":"1998","unstructured":"Ho, P.-H., Isles, A.J., Kam, T.: Formal verification of pipeline control using controlled token nets and abstract interpretation. In: Proceedings of the 1998 IEEE\/ACM international conference on Computer-aided design, pp. 529\u2013536. ACM Press, New York (1998)"},{"issue":"5","key":"11_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker SPIN. IEEE Trans. Softw. Eng.\u00a023(5), 279\u2013295 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"K.L. McMillan","year":"1995","unstructured":"McMillan, K.L.: A technique of state space search based on unfolding. Form. Methods Syst. Des.\u00a06(1), 45\u201365 (1995)","journal-title":"Form. Methods Syst. Des."},{"key":"11_CR13","first-page":"530","volume-title":"Proceedings of 39th Design Automation Conference","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: Proceedings of 39th Design Automation Conference, pp. 530\u2013535. ACM Press, New York (2001)"},{"issue":"5","key":"11_CR14","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/12.926158","volume":"50","author":"E. Pastor","year":"2001","unstructured":"Pastor, E., Cortadella, J., Roig, O.: Symbolic analysis of bounded petri. IEEE Transactions on Computers\u00a050(5), 432\u2013448 (2001)","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"D.A. Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. Journal of Symbolic Computation\u00a02, 293\u2013304 (1986)","journal-title":"Journal of Symbolic Computation"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-40922-X_8","volume-title":"Formal Methods in Computer-Aided Design","author":"M. Sheeran","year":"2000","unstructured":"Sheeran, M., Singh, S., St\u00e5lmarck, G.: Checking safety properties using induction and a sat-solver. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 108\u2013125. Springer, Heidelberg (2000)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/PRDC.2002.1185629","volume-title":"Proc. of 2002 Pacific Rim International Symposium on Dependable Computing (PRDC 2002)","author":"T. Tsuchiya","year":"2002","unstructured":"Tsuchiya, T., Nakamura, M., Kikuno, T.: Detecting Feature Interactions in Telecommunication Services with a SAT solver. In: Proc. of 2002 Pacific Rim International Symposium on Dependable Computing (PRDC 2002), pp. 131\u2013134. IEEE CS Press, Los Alamitos (2002)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-45657-0_15","volume-title":"Computer Aided Verification","author":"T. Yoneda","year":"2002","unstructured":"Yoneda, T., Kitai, T., Myers, C.: Automatic derivation of timing constraints by failure analysis. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 195\u2013208. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30476-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:02:37Z","timestamp":1620014557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30476-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540236108","9783540304760"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30476-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}