{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:17Z","timestamp":1725511997756},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709510"},{"type":"electronic","value":"9783540709527"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70952-7_6","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T08:40:01Z","timestamp":1182847201000},"page":"84-99","source":"Crossref","is-referenced-by-count":2,"title":["On Combining Partial Order Reduction with Fairness Assumptions"],"prefix":"10.1007","author":[{"given":"Lubo\u0161","family":"Brim","sequence":"first","affiliation":[]},{"given":"Ivana","family":"\u010cern\u00e1","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Moravec","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"\u0160im\u0161a","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-48234-2_4","volume-title":"Theoretical and Practical Aspects of SPIN Model Checking","author":"D. Bosnacki","year":"1999","unstructured":"Bosnacki, D.: Partial order reduction in presence of rendez-vous communications with unless constructs and weak fairness. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) Theoretical and Practical Aspects of SPIN Model Checking. LNCS, vol.\u00a01680, pp. 40\u201356. Springer, Heidelberg (1999)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.entcs.2004.10.019","volume":"128","author":"L. Brim","year":"2005","unstructured":"Brim, L., \u010cern\u00e1, I., Moravec, P., \u0160im\u0161a, J.: Distributed Partial Order Reduction. Electronic Notes in Theoretical Computer Science\u00a0128, 63\u201374 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"6_CR3","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"6_CR4","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"Francez, N.: Fairness. Texts and Monographs in Computer Science. Springer, Heidelberg (1986)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-56922-7_36","volume-title":"Computer Aided Verification","author":"P. Godefroid","year":"1993","unstructured":"Godefroid, P., Pirottin, D.: Refining dependencies improves partial-order verification methods. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 438\u2013449. Springer, Heidelberg (1993)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Holzmann, G.J., Godefroid, P., Pirottin, D.: Coverage preserving reduction strategies for reachability analysis. In: Proc. 12th Int. Conf on Protocol Specification, Testing, and Verification, INWG\/IFIP, Orlando, Fl., June (1992), citeseer.nj.nec.com\/holzmann92coverage.html","DOI":"10.1016\/B978-0-444-89874-6.50028-3"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Latvala, T., Heljanko, K.: Coping with strong fairness. Fundamenta Informaticae, 175\u2013193 (2000)","DOI":"10.3233\/FI-2000-43123409"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one from all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"6_CR9","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)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Peled, D., Wilke, T.: Stutter-invariant temporal properties are expressible without the nexttime operator. Information Processing Letters (1997)","DOI":"10.1016\/S0020-0190(97)00133-6"},{"key":"6_CR11","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)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Applications and Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70952-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T14:16:17Z","timestamp":1587651377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70952-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709510","9783540709527"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70952-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}