Affiliations: [a] Department of Computing, Macquarie University, Sydney, Australia. [email protected] | [b] Department of Computer Science, Aalborg University, Denmark. [email protected] | [c] Department of Computer Science, Aalborg University, Denmark. [email protected]
Correspondence:
[†]
Address for correspondence: Department of Computing, Macquarie University, Sydney, Australia
Note: [*] A preliminary version of this work appeared in [1].
Abstract: We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. We propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. All of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.
