A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We develop a HORNSAT-based methodology for verification of finite state systems. This general methodology leads naturally to algorithms, that are local [25, 19] , on the fly [28, 11, 13, 5] and incremental  . It also leads naturally to diagnostic behavioral relation checking  algorithms. Here we use it to develop model checking algorithms for various fragments of modal mu-calculus. We also use our methodology to develop a uniform game theoretic formulations of all the relations in thedoi:10.1007/3-540-61474-5_61 fatcat:kjzqwudy6fb3jbnr3qiozwrqoe