Abstract
Verification techniques for Timed Automata [2] built in tools like Kronos [7] are based on the fixpoint calculus of an appropriate operator. In this work, we present different alternatives to calculate that fixpoint, which have direct impact in the number of iterations needed to converge.
Highlights
Verification techniques for Timed Automata [2] built in tools like Kronos [7] are based on the fixpoint calculus of an appropriate operator
To verify logics like TCTL [1] over Timed Automata, it is usually required to obtain the set of states from which the system can evolve and reach a set of states satisfying a formula φ
In this work we explore different iterative methods to solve the question “Does the initial state belong to the characteristic set of φ1 ∃UI φ2?”, where φ1 and φ2 are TCTL formulas, and I bounds the time elapsed to reach φ2
Summary
Verification techniques for Timed Automata [2] built in tools like Kronos [7] are based on the fixpoint calculus of an appropriate operator. We present a method that tries to reduce the number of iterations needed to converge. This is achieved by making use of intermediate results obtained in the same iteration instead the intermediate. We have implemented a prototype for both strategies based on Kronos tool and we have obtained some preliminary experimental data. We compare both alternatives and suggest combinations that could outperform previous implementations
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.