{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:13Z","timestamp":1761610393946,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80296-8","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"71-84","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Partial order reductions for failures refinement"],"prefix":"10.1016","volume":"27","author":[{"given":"Heike","family":"Wehrheim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80296-8_BIB1","article-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume":"29","author":"\u201cWorkshop on Partial Order Methods in Verification\u201d","year":"1997","journal-title":"American Mathematical Society"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB2","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB3","doi-asserted-by":"crossref","unstructured":"Brookes, S.D., Roscoe, A.W., \u201cAn improved failures model for communicating processes.\u201d Brookes, S.D., Roscoe, A.W., Winskel, G., \u201cSeminar on Concurrency. Lecture Notes in Computer Science.\u201d 197, 1985, 281\u2013305","DOI":"10.1007\/3-540-15670-4_14"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB4","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for boolean function manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB5","series-title":"19th ACM POPL","article-title":"Model checking and abstraction","author":"Clarke","year":"1992"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB6","unstructured":"Dams, D., \u201cAbstract Interpretation and Partition Refinement for Model Checking,\u201d PhD thesis, Technische Universiteit Eindhoven, Faculteit der Wiskunde en Informatica (1996)."},{"year":"1997","series-title":"\u201cFailures-Divergence Refinement: FDR2 User Manual,\u201d","author":"Formal Systems (Europe) Ltd","key":"10.1016\/S1571-0661(05)80296-8_BIB7"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB8","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1109\/ISTCS.1995.377038","article-title":"A partial order approach to branching time logic model checking","author":"Gerth","year":"1995","journal-title":"Third Israel Symposium on Theory on Computing and Systems"},{"year":"1996","series-title":"\u201cPartial-Order Methods for the Verification of Concurrent Systems,\u201d Number 1032 in Lecture Notes in Computer Science, Springer","author":"Godefroid","key":"10.1016\/S1571-0661(05)80296-8_BIB9"},{"year":"1985","series-title":"\u201cCommunicating Sequential Processes,\u201d Prentice-Hall","author":"Hoare","key":"10.1016\/S1571-0661(05)80296-8_BIB10"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB11","article-title":"Partial order reductions for bisimulation checking","volume":"1530","author":"Huhn","year":"1998"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0890-5401(90)90025-D","article-title":"CCS expressions, finite state processes, and three problems of equivalence","volume":"86","author":"Kanellakis","year":"1990","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB13","first-page":"279","article-title":"Trace theory","volume":"255","author":"Mazurkiewicz","year":"1986"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB14","series-title":"in: Proc. 5th Workshop on Computer Aided Verification","article-title":"All from one, one for all: On model checking using representatives","author":"Peled","year":"1993"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB15","first-page":"90","article-title":"Using asynchronous B\u00fcchi automata for efficient model-checking of concurrent systems","author":"Peled","year":"1995","journal-title":"in: Protocol Specification, Testing and Verification"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB16","series-title":"in: Concur'97","article-title":"Partial-order reduction in the weak modal mucalculus","author":"Ramakrishna","year":"1997"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB17","article-title":"\u201cPetri Nets,\u201d","volume":"4","author":"Reisig","year":"1985"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB18","series-title":"A classical mind: Essays in honour of C.A.R. Hoare","article-title":"Model-checking CSP","author":"Roscoe","year":"1994"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB19","doi-asserted-by":"crossref","unstructured":"Roscoe, A. W., P. H. B. Gardiner, M. H. Goldsmith, J. R. Hulance, D. M. Jackson and J. B. Scattergood, Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock, in: Proceedings of the TACAS symposium, LNCS 1055 (1995).","DOI":"10.1007\/3-540-60630-0_7"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB20","doi-asserted-by":"crossref","unstructured":"Sassone, V., M. Nielsen and G. Winskel, A classification of models for concurrency, in: E. Best, editor, Concur '93, Lecture Notes in Computer Science 715 (1993), pp. 82\u201396, extended abstract.","DOI":"10.1007\/3-540-57208-2_7"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB21","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00709154","article-title":"A stubborn attack on state explosion","author":"Valmari","year":"1992","journal-title":"Formal Methods in System Design"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB22","series-title":"STRICT '95: Structures in Concurrency","article-title":"Failure-based equivalences are faster than many believe","author":"Valmari","year":"1995"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB23","first-page":"213","article-title":"Stubborn set methods for process algebras","volume":"29","author":"Valmari","year":"1997","journal-title":"Workshop on Partial Order Methods in Verification, DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80296-8_BIB24","first-page":"233","article-title":"Partial-order methods for temporal verification","volume":"715","author":"Wolper","year":"1993"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802968?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802968?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:30Z","timestamp":1761610050000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":24,"alternative-id":["S1571066105802968"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80296-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Partial order reductions for failures refinement","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80296-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}