Symbolic model checking in practice
SBCCI'99 Proceedings of the XIIth conference on Integrated circuits and systems design
| Hi-index | 0.00 |
Priority inversion is a serious problem that can make real-time systems unpredictable in subtle ways. This makes it more difficult to implement and debug such systems. Our work discusses this problem and presents one possible solution. The solution is formalized and verified using temporal logic model checking techniques. In order to perform the verification, the @c(bdd)-based symbolic model checking algorithm given in McMillan''s "Symbolic model checking -- an approach to the state explosion problem" was extended to handle real-time properties using the bounded until operator. We believe that this algorithm, which is based on discrete time, is able to handle many real-time properties that arise in practical problems.