A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation

Abstract In this paper, we consider a model of generalized timed automata (GTA) with two kinds clocks, history and future , that can express many features succinctly, including automata, event-clock without diagonal constraints, timers. Our main contribution is new simulation-based zone algorithm for checking reachability in unified model. While such algorithms are known to exist have recently been shown the first result handle constraints We also provide prototype implementation our show experimental results on several benchmarks. To best knowledge, effective not just model, but even timers or (with predicting clocks) going through costly translation via automata. Last least, beyond being interesting their own right, be used model-checking specifications over models.