Zone-based verification of timed automata: extrapolations, simulations and what next? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Zone-based verification of timed automata: extrapolations, simulations and what next?

Patricia Bouyer
Paul Gastin
B. Srivathsan
  • Function : Author
  • PersonId : 1049965

Abstract

Timed automata have been introduced by Rajeev Alur and David Dill in the early 90's. In the last decades, timed automata have become the de facto model for the verification of real-time systems. Algorithms for timed automata are based on the traversal of their state-space using zones as a symbolic representation. Since the state-space is infinite, termination relies on finite abstractions that yield a finite representation of the reachable states. The first solution to get finite abstractions was based on extrapolations of zones, and has been implemented in the industry-strength tool Uppaal. A different approach based on simulations between zones has emerged in the last ten years, and has been implemented in the fully open source tool TChecker. The simulation-based approach has led to new efficient algorithms for reachability and liveness in timed automata, and has also been extended to richer models like weighted timed automata, and timed automata with diagonal constraints and updates. In this article, we survey the extrapolation and simulation techniques, and discuss some open challenges for the future.

Dates and versions

hal-03654350 , version 1 (28-04-2022)

Identifiers

Cite

Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan. Zone-based verification of timed automata: extrapolations, simulations and what next?. FORMATS 2022 - 20th International Conference on Formal Modeling and Analysis of Timed Systems, Sep 2022, Warsaw, Poland. pp.1-27. ⟨hal-03654350⟩
31 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More