Abstract

Bounded model checking has been recently introduced as an efficient verification method for reactive systems. This technique reduces model checking of linear temporal logic to propositional satisfiability. However this method does not work well for asynchronous systems. In this paper we propose a new SAT-based verification method for asynchronous systems. Our method can reduce verification time by representing the behavior by very succinct formulas.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call