VERDS: Modeling and Verification of Finite State Systems with Discrete Time Models by Symbolic Techniques

Wenhui Zhang, Xue-Yang Zhu, Yulong Bao

Abstract: Model checking is considered one of the most practical applications of theoretical computer science in the verification of concurrent systems, and model checking tools are very important for such applications. This paper presents the model checking tool VERDS with the theoretical background, basic functionalities and modeling techniques with various examples. In particular, the tool includes an implementation of a bounded correctness checking approach which can be seen as an extension of bounded model checking and complementary to the traditional symbolic model checking. VERDS is also flexible for extension. We show how it is extended to handle discrete time models. We carry out case-studies of a kind of task scheduling problems, in which time specification is essential. The experimental results show that VERDS is not only feasible for solving practical problems but also with good performance in solving such problems.