{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:07:13Z","timestamp":1736399233595,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540331025"},{"type":"electronic","value":"9783540331032"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11691617_16","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T14:14:13Z","timestamp":1143555253000},"page":"271-287","source":"Crossref","is-referenced-by-count":12,"title":["Partial-Order Reduction for General State Exploring Algorithms"],"prefix":"10.1007","author":[{"given":"Dragan","family":"Bo\u0161na\u010dki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Leue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto Lluch","family":"Lafuente","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","first-page":"97","volume-title":"Computer Aided Verification","year":"1997","unstructured":"Alur, R., Brayton, R.K., Henzinger, T.A., Qadeer, S., Rajamani, S.K.: Partialorder reduction in symbolic state-space exploration. Formal Methods in System Design\u00a018, 97\u2013116 (2001); Grumberg, O. (ed.): CAV 1997. LNCS, vol.\u00a01254, pp. 97\u2013116. Springer, Heidelberg (1997)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/11537328_10","volume-title":"Model Checking Software","author":"D. Bo\u0161na\u010dki","year":"2005","unstructured":"Bo\u0161na\u010dki, D., Holzmann, G.J.: Improving Spin\u2019s Partial-Order Reduction for Breadth-First Search. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol.\u00a03639, pp. 91\u2013105. Springer, Heidelberg (2005)"},{"key":"16_CR3","unstructured":"Bo\u0161na\u010dki, D., Leue, S., Lluch Lafuente, A.: Partial-Order Reduction for General State Exploring Algorithms, Technical Report soft-05-02, Chair for Software Engineering, University of Konstanz (2005), http:\/\/www.inf.uni-konstanz.de\/soft\/research\/publications\/pdf\/soft-05-01.pdf"},{"key":"16_CR4","volume-title":"Model Checking","author":"E. Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10009-002-0104-3","volume":"5","author":"S. Edelkamp","year":"2004","unstructured":"Edelkamp, S., Lluch Lafuente, A., Leue, S.: Directed explicit-state model checking in the validation of communication protocols. Software Tools for Technology Transfer\u00a05, 247\u2013267 (2004)","journal-title":"Software Tools for Technology Transfer"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10009-004-0151-z","volume":"6","author":"S. Edelkamp","year":"2004","unstructured":"Edelkamp, S., Leue, S., Lluch Lafuente, A.: Partial-order reduction and trail improvement in directed model checking. International Journal on Software Tools for Technology Transfer\u00a06(4), 277\u2013301 (2004)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1998.2778","volume":"150","author":"R. Gerth","year":"1999","unstructured":"Gerth, R., Kuiper, R., Peled, D., Penczek, W.: A Partial-Order Approach to Branching Time Logic Model Checking. Information and Computation\u00a0150(2), 132\u2013152 (1999)","journal-title":"Information and Computation"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems","author":"P. Godefroid","year":"1996","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol.\u00a01032. Springer, Heidelberg (1996)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-55179-4_32","volume-title":"Computer Aided Verification","author":"P. Godefroid","year":"1992","unstructured":"Godefroid, P., Wolper, P.: Using Partial-Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 332\u2013342. Springer, Heidelberg (1992)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for heuristic determination of minimum path costs. IEEE Transactions on Systems Science and Cybernetics\u00a04, 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"16_CR11","volume-title":"The SPIN Model Checker: Primer and Reference Manual","author":"G.J. Holzmann","year":"2003","unstructured":"Holzmann, G.J.: The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, Reading (2003)"},{"key":"16_CR12","first-page":"349","volume-title":"Proc. 12th IFIP WG 6.1. International Symposium on Protocol Specification, Testing, and Validation, FORTE\/PSTV 1992","author":"G.J. Holzmann","year":"1992","unstructured":"Holzmann, G.J., Godefroid, P., Pirottin, D.: Coverage Preserving Reduction Strategies for Reachability Analysis. In: Proc. 12th IFIP WG 6.1. International Symposium on Protocol Specification, Testing, and Validation, FORTE\/PSTV 1992, pp. 349\u2013363. North-Holland, Amsterdam (1992)"},{"key":"16_CR13","unstructured":"Holzmann, G.J., Peled, D.: An Improvement in Formal Verification, FORTE 1994, Bern, Switzerland (1994)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BFb0054182","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R.P. Kurshan","year":"1998","unstructured":"Kurshan, R.P., Levin, V., Minea, M., Peled, D., Yenig\u00fcn, H.: Static Partial-Order Reduction. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 345\u2013357. Springer, Heidelberg (1998)"},{"key":"16_CR15","unstructured":"Lluch-Lafuente, A., Edelkamp, S., Leue, S.: Directed Search for the Verification of Communication Protocols, PhD Thesis, Freiburger Dokument Server, Institute of Computer Science, University of Freiburg (June 2003)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/11537328_11","volume-title":"Model Checking Software","author":"V. Levin","year":"2005","unstructured":"Levin, V., Palmer, R., Qadeer, S., Rajamani, S.K.: Sound Transaction-Based Reduction Without Cycle Detection. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol.\u00a03639, pp. 106\u2013121. Springer, Heidelberg (2005)"},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1023\/A:1014728912264","volume":"20","author":"R. Nalumasu","year":"2002","unstructured":"Nalumasu, R., Gopalakrishnan, G.: An Efficient Partial-Order Reduction Algorithm with an Alternative Proviso Implementation. Formal Methods in System Design\u00a020(3), 231\u2013247 (2002)","journal-title":"Formal Methods in System Design"},{"key":"16_CR18","volume-title":"Principles of Artificial Intelligence","author":"N.J. Nilsson","year":"1980","unstructured":"Nilsson, N.J.: Principles of Artificial Intelligence. Tioga Publishing Co. Palo Alto, California (1980)"},{"key":"16_CR19","unstructured":"Overman, W.T.: Verification of Concurrent Systems: Function and Timing, Ph.D. Thesis, UCLA, Los Angeles, California (1981)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/3-540-36135-9_26","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2002","author":"R. Palmer","year":"2002","unstructured":"Palmer, R., Gopalakrishnan, G.: A Distributed Partial Order Reduction Algorithm. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol.\u00a02529, p. 370. Springer, Heidelberg (2002)"},{"key":"16_CR21","volume-title":"Heuristics","author":"J. Pearl","year":"1985","unstructured":"Pearl, J.: Heuristics. Addison-Wesley, Reading (1985)"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00121262","volume":"8","author":"D.A. Peled","year":"1996","unstructured":"Peled, D.A.: Combining Partial-Order Reductions with On-the-Fly Model Checking. Formal Methods on Systems Design\u00a08, 39\u201364 (1996); A previous version appeared in Computer Aided Verification. LCNS, vol. 818, pp. 377\u2013390, (1994)","journal-title":"Formal Methods on Systems Design"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Willems, B., Wolper, P.: Partial-Order Models for Model Checking: From Linear to Branching Time. In: Proc. of 11 Symposium of Logics in Computer Science, New Brunswick. LICS, vol.\u00a096, pp. 294\u2013303 (1996)","DOI":"10.1109\/LICS.1996.561357"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-51285-3_35","volume-title":"PARLE \u201989 - Parallel Architectures and Languages Europe","author":"A. Valmari","year":"1989","unstructured":"Valmari, A.: Eliminating Redundant Interleavings during Concurrent Program Verification. In: Odijk, E., Rem, M., Syre, J.-C. (eds.) PARLE 1989. LNCS, vol.\u00a0366, pp. 89\u2013103. Springer, Heidelberg (1989)"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BFb0023729","volume-title":"Computer-Aided Verification","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: A Stubborn Attack on State Explosion. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol.\u00a0531, pp. 156\u2013165. Springer, Heidelberg (1991)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","volume-title":"Lectures on Petri Nets I: Basic Models","author":"A. Valmari","year":"1998","unstructured":"Valmari, A.: The State Explosion Problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 429\u2013528. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11691617_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T04:53:15Z","timestamp":1736311995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11691617_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540331025","9783540331032"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11691617_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}