{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T02:26:02Z","timestamp":1761963962405,"version":"3.43.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Formal Methods in System Design"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1023\/a:1011202615884","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T04:18:21Z","timestamp":1040617101000},"page":"275-289","source":"Crossref","is-referenced-by-count":17,"title":["Relaxed Visibility Enhances Partial Order Reduction"],"prefix":"10.1007","volume":"19","author":[{"given":"Doron","family":"Peled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antti","family":"Valmari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkka","family":"Kokkarinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"354073_CR1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF00121128","volume":"1","author":"C. Courcoubetis","year":"1992","unstructured":"C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis, \u201cMemory-efficient algorithms for the verification of temporal properties,\u201d Formal Methods in System Design, Vol. 1, pp. 275\u2013288, 1992.","journal-title":"Formal Methods in System Design"},{"key":"354073_CR2","volume-title":"Protocol Specification Testing and Verification, PSTV95","author":"R. Gerth","year":"1995","unstructured":"R. Gerth, D. Peled, M. Vardi, and P. Wolper, \u201cSimple on-the-fly automatic verification of linear temporal logic,\u201d in Protocol Specification Testing and Verification, PSTV95, March 18, 1995, Warsaw, Poland, Chapman & Hall, London."},{"key":"354073_CR3","first-page":"176","volume-title":"Proc. 2nd Workshop on Computer Aided Verification, LNCS","author":"P. Godefroid","year":"1990","unstructured":"P. Godefroid, \u201cUsing partial orders to improve automatic verification methods,\u201d in Proc. 2nd Workshop on Computer Aided Verification, LNCS 531, Springer-Verlag, New Brunswick, NJ, 1990, pp. 176\u2013185."},{"key":"354073_CR4","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-56922-7_36","volume-title":"5th Conference on Computer Aided Verification, Elounda, Greece,LNCS","author":"P. Godefroid","year":"1993","unstructured":"P. Godefroid and D. Pirottin, \u201cRefining dependencies improves partial order verification methods,\u201d in 5th Conference on Computer Aided Verification, Elounda, Greece,LNCS 697, Springer-Verlag, New York, 1993, pp. 438\u2013449."},{"key":"354073_CR5","doi-asserted-by":"crossref","unstructured":"P. Godefroid and P. Wolper, \u201cA partial approach to model checking,\u201d in 6th Annual IEEE Symposium on Logic in Computer Science, Amsterdam, 1991, pp. 406\u2013415.","DOI":"10.1109\/LICS.1991.151664"},{"key":"354073_CR6","volume-title":"Design and Validation of Communication Protocols","author":"G. Holzmann","year":"1990","unstructured":"G. Holzmann, Design and Validation of Communication Protocols, 1990, Prentice Hall, New York."},{"key":"354073_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02252682","volume":"6","author":"S. Katz","year":"1992","unstructured":"S. Katz and D. Peled, \u201cVerification of distributed programs using representative interleaving sequences,\u201d Distributed Computing, Vol. 6, pp. 107\u2013120, 1992.","journal-title":"Distributed Computing"},{"key":"354073_CR8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(92)90054-J","volume":"101","author":"S. Katz","year":"1992","unstructured":"S. Katz and D. Peled, \u201cDefining conditional independence using collapses,\u201d Theoretical Computer Science, Vol. 101, pp. 337\u2013359, 1992.","journal-title":"Theoretical Computer Science"},{"key":"354073_CR9","volume-title":"A verification oriented theory of data in labeled transition system","author":"I. Kokkarinen","year":"1998","unstructured":"I. Kokkarinen, \u201cA verification oriented theory of data in labeled transition system,\u201d Ph.D. thesis, Tampere University of Technology, Finland, 1998."},{"key":"354073_CR10","first-page":"657","volume-title":"Information Processing 83","author":"L. Lamport","year":"1983","unstructured":"L. Lamport, \u201cWhat good is temporal logic,\u201d in Information Processing 83, Elsevier Science Publishers, New York, 1983, pp. 657\u2013668."},{"key":"354073_CR11","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"5th Conference on Computer Aided Verification, Elounda, Greece, LNCS","author":"D. Peled","year":"1993","unstructured":"D. Peled, \u201cAll from one, one for all, on model-checking using representatives,\u201d in 5th Conference on Computer Aided Verification, Elounda, Greece, LNCS 697, Springer-Verlag, New York, 1993, pp. 409\u2013423."},{"key":"354073_CR12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00121262","volume":"8","author":"D. Peled","year":"1996","unstructured":"D. Peled, \u201cCombining partial order reductions with on-the-fly model-checking,\u201d Formal Methods in System Design, Vol. 8, pp. 39\u201364, 1996.","journal-title":"Formal Methods in System Design"},{"issue":"2","key":"354073_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0304-3975(97)00219-3","volume":"195","author":"D. Peled","year":"1998","unstructured":"D. Peled, Th. Wilke, and P. Wolper, \u201cAn algorithmic approach for checking closure properties of temporal logic specification and \u03c9-regular languages,\u201d Theoretical Computer Science, Vol. 195, No. 2, pp. 183\u2013203, 1998.","journal-title":"Theoretical Computer Science"},{"key":"354073_CR14","doi-asserted-by":"crossref","unstructured":"A. Pnueli, \u201cThe temporal logic of programs,\u201d in 18th FOCS, IEEE Symposium on Foundation of Computer Science, 1977, pp. 46\u201357.","DOI":"10.1109\/SFCS.1977.32"},{"key":"354073_CR15","first-page":"491","volume-title":"10th International Conference on Application and Theory of Petri Nets, Bonn, Germany, LNCS","author":"A. Valmari","year":"1989","unstructured":"A. Valmari, \u201cStubborn sets for reduced state space generation,\u201d in 10th International Conference on Application and Theory of Petri Nets, Bonn, Germany, LNCS 483, Springer-Verlag, New York, 1989, pp. 491\u2013515"},{"key":"354073_CR16","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00709154","volume":"1","author":"A. Valmari","year":"1992","unstructured":"A. Valmari, \u201cA stubborn attack on state explosion,\u201d Formal Methods in System Design, Vol. 1, pp. 297\u2013322, 1992.","journal-title":"Formal Methods in System Design"},{"key":"354073_CR17","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/3-540-56922-7_33","volume-title":"5th Conference on Computer Aided Verification, Elounda, Greece, LNCS","author":"A. Valmari","year":"1993","unstructured":"A. Valmari, \u201cOn-the-fly verification with stubborn sets,\u201d in 5th Conference on Computer Aided Verification, Elounda, Greece, LNCS 697, Springer-Verlag, New York, 1993, pp. 397\u2013408."},{"key":"354073_CR18","unstructured":"M.Y. Vardi and P. Wolper, \u201cAn automata-theoretic approach to automatic program verification,\u201d in Proceedings of the First Symposium on Logic in Computer Science, 1986, pp. 322\u2013331."},{"key":"354073_CR19","doi-asserted-by":"crossref","unstructured":"B. Willems and P. Wolper, \u201cPartial-order methods for model checking: From linear time to branching time,\u201d in 11th Annual IEEE Symposium on Logic in Computer Science, 1996, pp. 294\u2013303.","DOI":"10.1109\/LICS.1996.561357"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011202615884.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011202615884\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011202615884.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T19:06:52Z","timestamp":1754420812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011202615884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["354073"],"URL":"https:\/\/doi.org\/10.1023\/a:1011202615884","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"type":"print","value":"0925-9856"},{"type":"electronic","value":"1572-8102"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}