Algorithms and protocols with time dependent behavior are often specified formally using timed automata. For practical real-time systems, besides real-valued clock variables, these specifications typically contain discrete data variables with nontrivial data flow. In this paper, we propose a configurable lazy abstraction framework for the location reachability problem of timed automata that potentially contain discrete variables. Moreover, based on our previous work, we uniformly formalize in our framework several abstraction refinement strategies for both clock and discrete variables that can be freely combined, resulting in many distinct algorithm configurations. Besides the proposed refinement strategies, the configurability of the framework allows the integration of existing efficient lazy abstraction algorithms for clock variables based on $${\textit{LU}}$$ -bounds. We demonstrate the applicability of the framework and the proposed refinement strategies by an empirical evaluation on a wide range of timed automata models, including ones that contain discrete variables or diagonal constraints.

中文翻译：

---

具有离散变量的定时自动机的可配置验证

具有时间相关行为的算法和协议通常使用定时自动机正式指定。对于实际的实时系统，除了实值时钟变量之外，这些规范通常包含具有非平凡数据流的离散数据变量。在本文中，我们针对可能包含离散变量的定时自动机的位置可达性问题提出了一个可配置的惰性抽象框架。此外，基于我们之前的工作，我们在我们的框架中统一形式化了时钟和离散变量的几种抽象细化策略，可以自由组合，从而产生许多不同的算法配置。除了提出的细化策略，该框架的可配置性允许集成现有的基于 $${\textit{LU}}$$ -bounds 的时钟变量的高效惰性抽象算法。我们通过对各种定时自动机模型（包括包含离散变量或对角约束的模型）的经验评估，证明了该框架和所提出的细化策略的适用性。