BMC Encoding for Concurrent Systems

Bounded model checking (BMC) is an efficient verification technique designed originally for synchronous systems. Recently, however, several studies have been conducted that attempt to apply BMC to concurrent systems. In this paper, we propose a BMC encoding for systems modeled as synchronized products of transition systems. Our encoding generates compact formulas compared to basic methods, and thus decreases the execution time needed for the SAT-solving process. The correctness and effectiveness of the proposed method is shown through several experimentations.