Search For:

Displaying 1-2 out of 2 total
Coverage Estimation in Model Checking with Bitstate Hashing
Found in: IEEE Transactions on Software Engineering
By Satoshi Ikeda,Masahiro Jibiki,Yasushi Kuno
Issue Date:April 2013
pp. 477-486
Explicit-state model checking which is conducted by state space search has difficulty in exploring satisfactory state space because of its memory requirements. Though bitstate hashing achieves memory efficiency, it cannot guarantee complete verification. T...
Fair Circulation of a Token
Found in: IEEE Transactions on Parallel and Distributed Systems
By Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita
Issue Date:April 2002
pp. 367-372
<p>Suppose that a distributed system is modeled by an undirected graph G = (V,E), where V and E, respectively, are the sets of processes and communication links. Israeli and Jalfon proposed a simple self-stabilizing mutual exclusion algorithm: A toke...