Abstract

Timed automata (TA) (Alur and Dill, 1994) have emerged as an important formalism for the formal modelling and analysis of timed systems. Reachability analysis forms the core of TA-based verification tools such as UPPAAL (Bengtsson and Yi, 2004), which implement a zone-based forward reachability analysis (FRA) algorithm. We present here a symbolic (zone-based) FRA algorithm for deciding safety (reachability) of TA, which is robust w.r.t clock-drift, and which involves minimal overhead w.r.t the standard FRA algorithm of UPPAAL and is guaranteed to terminate in a number of iterations comparable to the standard case.

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 call

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.