Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives
As a complementary technique of the BDD-based approach, bounded model checking (BMC) has been successfully applied to LTL symbolic model checking. However, the expressiveness of LTL is rather limited, and some important properties cannot be captured by such logic. In this paper, we present a semanti...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/462532 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | As a complementary technique of the BDD-based approach, bounded model checking (BMC) has
been successfully applied to LTL symbolic model checking. However, the expressiveness of LTL is
rather limited, and some important properties cannot be captured by such logic. In this paper, we
present a semantic BMC encoding approach to deal with the mixture of ETLf and ETLl. Since
such kind of temporal logic involves both finite and looping automata as connectives, all regular
properties can be succinctly specified with it. The presented algorithm is integrated into the model
checker ENuSMV, and the approach is evaluated via conducting a series of imperial experiments. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |