{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:36:56Z","timestamp":1648935416866},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10472-009-9167-0","type":"journal-article","created":{"date-parts":[[2009,10,28]],"date-time":"2009-10-28T17:11:40Z","timestamp":1256749900000},"page":"187-210","source":"Crossref","is-referenced-by-count":0,"title":["On commutativity based Edge Lean search"],"prefix":"10.1007","volume":"56","author":[{"given":"Dragan","family":"Bo\u0161na\u010dki","sequence":"first","affiliation":[]},{"given":"Edith","family":"Elkind","sequence":"additional","affiliation":[]},{"given":"Blaise","family":"Genest","sequence":"additional","affiliation":[]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,29]]},"reference":[{"issue":"4","key":"9167_CR1","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1023\/B:AUSE.0000038937.18006.3d","volume":"11","author":"T Basten","year":"2004","unstructured":"Basten, T., Bo\u0161na\u010dki, D., Geilen, M.: Cluster-based partial order reduction. Autom. Softw. Eng., 11(4), 365\u2013402 (2004)","journal-title":"Autom. Softw. Eng."},{"key":"9167_CR2","series-title":"LNCS","volume-title":"Assume-Guarantee Model Checking of Software: a Comparative Case Study, in Theoretical and Practical Aspects of SPIN Model Checking","author":"CS P\u0103s\u0103reanu","year":"1999","unstructured":"P\u0103s\u0103reanu, C.S., Dwyer, M.B., Huth, M.: Assume-Guarantee Model Checking of Software: a Comparative Case Study, in Theoretical and Practical Aspects of SPIN Model Checking. LNCS 1680. Springer, New York (1999)"},{"key":"9167_CR3","volume-title":"Model Checking","author":"E Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT, Cambridge (2000)"},{"key":"9167_CR4","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems\u2014An Approach to the State-Explosion Problem. PhD thesis, University of Liege, Computer Science Department (1994)"},{"key":"9167_CR5","unstructured":"Godefroid, P., Wolper, P.: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. In: CAV 1991, pp.\u00a0176\u2013185 (1991)"},{"issue":"3","key":"9167_CR6","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF01384077","volume":"7","author":"P Godefroid","year":"1995","unstructured":"Godefroid, P., Holzmann, G., Pirottin, D.: State-space caching revisited. Form. Methods Syst. Des. 7(3), 227\u2013242 (1995)","journal-title":"Form. Methods Syst. Des."},{"key":"9167_CR7","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebra. Proc. Lond. Math. Soc. 2, 326\u2013336 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"9167_CR8","volume-title":"The SPIN Model Checking","author":"G Holzmann","year":"2003","unstructured":"Holzmann, G.: The SPIN Model Checking. Addison Wesley, Reading (2003)"},{"key":"9167_CR9","unstructured":"Mazurkiewicz, A.: Trace semantics. In: Advances in Petri Nets 1986, LNCS 255, pp.\u00a0279\u2013324 (1986)"},{"key":"9167_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1142\/9789814261456_0006","volume-title":"The Book of Traces","author":"E Ochmanski","year":"1995","unstructured":"Ochmanski, E.: Languages and Automata. In: V. Diekert, G. Rozenberg (eds.) The Book of Traces, pp.\u00a0167\u2013204. World Scientific, Singapore (1995)"},{"key":"9167_CR11","doi-asserted-by":"crossref","unstructured":"Peled, D.: Combining Partial Order Reductions with On-the-fly Model-Checking. In: CAV 1994, LNCS 818, pp.\u00a0377\u2013390 (1994)","DOI":"10.1007\/3-540-58179-0_69"},{"key":"9167_CR12","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Depth-First Search and Linear Graph Algorithms. In: FOCS 1971, pp.\u00a0114\u2013121 (1971)","DOI":"10.1109\/SWAT.1971.10"},{"issue":"4","key":"9167_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00709154","volume":"1","author":"A Valmari","year":"1992","unstructured":"Valmari, A.: A stubborn attack on state explosion. Form. Methods Syst. Des. 1(4), 297\u2013322 (1992)","journal-title":"Form. Methods Syst. Des."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9167-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-009-9167-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9167-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:58:13Z","timestamp":1559152693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-009-9167-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9167"],"URL":"https:\/\/doi.org\/10.1007\/s10472-009-9167-0","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}