{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:03:49Z","timestamp":1649142229097},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,8]]},"abstract":"<jats:p> We propose a new SAT-based model checking algorithm to solve the reachability problem of real-time systems. In our algorithm, the behavior of region automata is encoded as Boolean formulas, and hence any SAT solver can be used to explore the region graph efficiently. Although our SAT-based algorithm performs better than other algorithms in flaw detection, it is less effective in proving properties. To overcome the problem, we incorporate a complete inductive method in our algorithm to improve the performance when the property is satisfied. We implement both algorithms in a tool called xBMC and report experimental results. The experiments show that the combination of efficient encoding and inductive methods offers an effective and practical method for the analysis of timing behavior. <\/jats:p>","DOI":"10.1142\/s0129054106004108","type":"journal-article","created":{"date-parts":[[2006,8,4]],"date-time":"2006-08-04T22:37:04Z","timestamp":1154731024000},"page":"775-795","source":"Crossref","is-referenced-by-count":0,"title":["SAT-BASED MODEL CHECKING FOR REGION AUTOMATA"],"prefix":"10.1142","volume":"17","author":[{"given":"FANG","family":"YU","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of California at Santa Barbara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BOW-YAW","family":"WANG","sequence":"additional","affiliation":[{"name":"Institute of Information Science, Academia Sinica, Taipei 115, Taiwan, Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"rf5","first-page":"677","volume":"35","author":"Bryant R. E.","journal-title":"IEEE Trans. Computers"},{"key":"rf10","author":"Clarke E.","journal-title":"Formal Methods in System Design"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050010"},{"key":"rf27","first-page":"223","volume":"55","author":"Wozna B.","journal-title":"Fundamenta Informaticae"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:40:23Z","timestamp":1565138423000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":5,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,8]]}},"alternative-id":["10.1142\/S0129054106004108"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004108","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}