Exploring Computation Tree Logic with Past-Time Operator Model Checking Using DNA Computing

Abstract

Computation tree logic (CTL) model checking is a verification technique that is important to safety-critical systems. DNA computing provides new ideas for improving the efficiency and solving the state space explosion problem of CTL model checking. However, existing research mainly focuses on DNA computing methods for checking CTL with future-time operators and has not addressed CTL with past-time operators (CTLP). In this paper, we propose a DNA computing method for CTLP model checking. First, a system to be checked and a CTLP formula are encoded by DNA strands. Next, all the strands are mixed into a test tube. Then, the complementary strands in the test tube hybridize and form fully or partially double-stranded DNA molecules. Finally, a series of biochemical operations are performed to detect the double-stranded DNA molecules, and whether the system satisfies the CTLP formula is determined. Simulations show the validity and effectiveness of the method. Our new method enhances the power and lays the foundation for the completeness of CTL model checking.