[Paper Review] Zone-based verification of timed automata: extrapolations, simulations and what next?

Patricia Bouyer, Paul Gastin+3 more|arXiv (Cornell University)|Jul 15, 2022

Formal Methods in Verification76 references4 citations

TL;DR

This paper surveys zone-based verification techniques for timed automata, comparing extrapolation and simulation-based approaches that enable finite abstractions for reachability analysis. It highlights the simulation-based method in TChecker as a scalable alternative to extrapolation, enabling efficient verification of complex models like weighted and pushdown timed automata, and outlines future challenges in partial-order reduction, domain-specific algorithms, and richer models.

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.

Motivation & Objective

• To compare and contrast the two dominant symbolic verification approaches for timed automata: extrapolation and simulation.
• To analyze the limitations of extrapolation-based methods and the advantages of simulation-based techniques in achieving termination and scalability.
• To identify open challenges in timed automata verification, including partial-order reduction, domain-specific optimizations, and extensions to richer models.
• To discuss the practical impact of these techniques through implementations in tools like Uppaal and TChecker.
• To guide future research by identifying unresolved issues such as finite abstractions under local-time semantics and integration with SAT/BDD-based methods.

Proposed method

• Uses symbolic forward analysis with zones as compact representations of sets of clock valuations.
• Employs extrapolation to over-approximate zones with finite-range abstractions, ensuring termination of forward exploration.
• Applies simulation relations between zones to detect when further exploration is redundant, enabling termination without over-approximation.
• Uses Difference Bound Matrices (DBMs) as a canonical data structure for efficient zone manipulation and operations.
• Integrates dynamic abstractions and refinement techniques in simulation-based algorithms to improve performance on liveness and complex properties.
• Extends simulation-based approaches to richer models, including weighted timed automata, pushdown timed automata, and event-clock automata.

Experimental results

Research questions

• RQ1 How do extrapolation and simulation-based approaches differ in their ability to ensure termination and completeness in timed automata verification?
• RQ2 What are the theoretical and practical limitations of extrapolation-based methods in handling complex clock constraints and updates?
• RQ3 Can simulation-based techniques be generalized to support richer models such as parametric, probabilistic, or controller synthesis problems in timed automata?
• RQ4 What are the challenges in combining partial-order reduction with finite abstractions in networks of timed automata?
• RQ5 How can domain-specific optimizations improve verification performance for models with large discrete state spaces, such as funnel automata?

Key findings

• The simulation-based approach in TChecker outperforms extrapolation-based methods in several benchmarks, particularly for models with diagonal constraints and complex updates.
• Simulation-based finite abstractions have enabled efficient verification of weighted timed automata and pushdown timed automata, extending beyond the reach of classical extrapolation.
• Extrapolation-based methods, while effective in Uppaal, suffer from over-approximation and cannot handle certain classes of constraints or updates reliably.
• Partial-order reduction in timed automata remains challenging due to the global nature of time, and no finite abstraction compatible with partial-order reduction exists in general for local-time semantics.
• Domain-specific algorithms—such as those combining BDDs and zones—show promise for accelerating verification in models like funnel automata with few clocks but large discrete state spaces.
• The integration of zone-based methods with SAT/SMT and BDD-based solvers is complementary, suggesting that a multi-paradigm verification toolbox is essential for diverse real-time systems.