{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:10:53Z","timestamp":1751429453351,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2014,4]]},"abstract":"<jats:p> The sweep-line method allows explicit state model checkers to delete states from memory on-the-fly during state space exploration, thereby lowering the memory demands of the verification procedure. The sweep-line method is based on a least-progress-first search order that prohibits the immediate use of standard on-the-fly B\u00fcchi automata-based model checking algorithms that rely on a depth-first search order in the search for an acceptance cycle. This paper proposes and experimentally evaluates an algorithm for B\u00fcchi automata-based model checking compatible with the search order and deletion of states prescribed by the sweep-line method. <\/jats:p>","DOI":"10.3233\/fi-2014-1003","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T05:51:27Z","timestamp":1575352287000},"page":"27-53","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["A Sweep-Line Method for B\u00fcchi Automata-based Model Checking"],"prefix":"10.1177","volume":"131","author":[{"given":"Sami","family":"Evangelista","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris 13, Sorbonne Paris Cit\u00e9, LIPN, CNRS, UMR 7030, F-93430, Villetaneuse, France. sami.evangelista@lipn.univ-paris13.fr"}]},{"given":"Lars Michael","family":"Kristensen","sequence":"additional","affiliation":[{"name":"Department of Computing, Mathematics, and Physics, Bergen University College, Norway. Lars.Michael.Kristensen@hib.no"}]}],"member":"179","published-online":{"date-parts":[[2014,4,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2014-1003","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2014-1003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:51:31Z","timestamp":1751367091000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2014-1003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["10.3233\/FI-2014-1003"],"URL":"https:\/\/doi.org\/10.3233\/fi-2014-1003","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"type":"print","value":"0169-2968"},{"type":"electronic","value":"1875-8681"}],"subject":[],"published":{"date-parts":[[2014,4]]}}}