{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:40:32Z","timestamp":1737394832735,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73420-8_16","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"158-170","source":"Crossref","is-referenced-by-count":4,"title":["On Commutativity Based Edge Lean Search"],"prefix":"10.1007","author":[{"given":"Dragan","family":"Bo\u0161na\u010dki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edith","family":"Elkind","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Blaise","family":"Genest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"16_CR1","doi-asserted-by":"publisher","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. Automated Software Engineering\u00a011(4), 365\u2013402 (2004)","journal-title":"Automated Software Engineering"},{"key":"16_CR2","unstructured":"Bo\u0161na\u010dki, D., Elkind, E., Genest, B., Peled, D.: On Commutativity Based Edge Lean Search (full version), http:\/\/perso.crans.org\/~genest\/BEGP.ps"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Theoretical and Practical Aspects of SPIN Model Checking","author":"C.S. 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: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) Theoretical and Practical Aspects of SPIN Model Checking. LNCS, vol.\u00a01680, Springer, Heidelberg (1999)"},{"key":"16_CR4","volume-title":"Model Checking","author":"E. Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"16_CR5","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems \u2013 An Approach to the State-Explosion Problem, PhD thesis, University of Liege, Computer Science Department (November 1994)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BFb0023731","volume-title":"Computer Aided Verification","author":"P. Godefroid","year":"1991","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. 176\u2013185. Springer, Heidelberg (1991)"},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","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. Formal Methods in System Design\u00a07(3), 227\u2013242 (1995)","journal-title":"Formal Methods in System Design"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.J.: Efficiently Mining Maximal Feqent Itemsets. In: IEEE International Conference on Data Mining (ICDM 2001), pp. 163\u2013170 (2001)","DOI":"10.1109\/ICDM.2001.989514"},{"key":"16_CR9","volume-title":"The SPIN Model Checking","author":"G. Holzmann","year":"2003","unstructured":"Holzmann, G.: The SPIN Model Checking. Addison Wesley, Reading (2003)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1093\/bioinformatics\/bth919","volume":"20","author":"M. Koyuturk","year":"2004","unstructured":"Koyuturk, M., Grama, A., Szpankowski, W.: An Efficient Algorithm for Detecting Frequent Subgraphs in Biological Networks. Bioinformatics\u00a020, i200\u2013i207 (2004)","journal-title":"Bioinformatics"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","first-page":"279","volume-title":"Advances in Petri Nets","author":"A. Mazurkiewicz","year":"1986","unstructured":"Mazurkiewicz, A.: Trace semantics. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets. LNCS, vol.\u00a0255, pp. 279\u2013324. Springer, Heidelberg (1986)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Ochmanski, E.: Languages and Automata. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, pp. 167\u2013204 (1995)","DOI":"10.1142\/9789814261456_0006"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-58179-0_69","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1994","unstructured":"Peled, D.: Combining Partial Order Reductions with On-the-fly Model-Checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 377\u2013390. Springer, Heidelberg (1994)"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF00709154","volume":"1","author":"A. Valmari","year":"1992","unstructured":"Valmari, A.: A Stubborn Attack on State Explosion. Formal Methods in System Design\u00a01(4), 297\u2013322 (1992)","journal-title":"Formal Methods in System Design"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:15:41Z","timestamp":1737393341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734192","9783540734208"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}