Abstract
Verifications of real-time software are important. However, the state explosion problem is serious for model checking verifications. We present a symbolic model checking algorithm for real-time software, which can check CTL properties without computing exact states. Based on an approximation method, we formulate an approximation/refinement procedure for symbolic model checking, which recursively computes approximate states and iteratively refines approximations. The algorithm reduces the state explosion, using approximations of time zone and symbolic representations with DBMs (difference bounded matrices) and BDDs (binary decision diagrams). We have implemented the algorithm and experimented with the CSMA/CD protocol. Experimental results show that our method can verify large real-time systems which cannot be handled by conventional symbolic model checkers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
