On Improving Backwards Verification of Timed Automata (Extended Abstract)

Victor Braberman, Carlos López Pombo, Alfredo Olivero
2002 Electronical Notes in Theoretical Computer Science  
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. Open access under CC BY-NC-ND license.
doi:10.1016/s1571-0661(04)80469-9 fatcat:ugffuym5kjcdhprszhjpyrgkb4