document: Bounded model checking for the universal fragment of CTL Bounded Model Checking -LRB- BMC -RRB- 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 -LRB- LTL -RRB- . Our paper shows how the concept of bounded model checking can be extended to ACTL -LRB- the universal fragment of CTL -RRB- . The implementation of the algorithm for Elementary Net Systems is described together with the experimental results
doc_bio_tags: B I I O O B I O O B I I O O O O O O O O O O B I O B I O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O B I I I O O O O O O O O O O O B I I O O O O O O O B I O O O O O O O O O O B I I O O O O O O O
extractive_keyphrases: bounded model checking universal fragment verification method reactive systems sat methods propositional formula model checking linear time temporal logic elementary net systems
abstractive_keyphrases: bounded semantics