Bounded Model Checking for the Universal Fragment of CTL

Issue title: Concurrency Specification and Programming Workshop (CS&P'2001)

Article type: Research Article

Authors: Penczek, Wojciech | Woźna, Bożena | Zbrzezny, Andrzej

Affiliations: Institute of Computer Science, PAS, Ordona 21, 01-237 Warsaw, Poland | Institute of Mathematics and Computer Science, PU, Armii Krajowej 13/15, 42-200 Czestochowa, Poland

Abstract: Bounded Model Checking (BMC) has been recently introduced as an efficient verification method for reactive systems. BMC based on SAT methods consists in searching for a counterexample of a particular length and generating a propositional formula that is satisfiable iff such a counterexample exists. This new technique has been introduced by E. Clarke et al. for model checking of linear time temporal logic (LTL). Our paper shows how the concept of bounded model checking can be extended to ACTL (the universal fragment of CTL). The implementation of the algorithm for Elementary Net Systems is described together with the experimental results.

Keywords: Bounded model checking, logic ACTL (ECTL), bounded semantics, translation to SAT, Elementary Net Systems, system verification

Journal: Fundamenta Informaticae, vol. 51, no. 1-2, pp. 135-156, 2002