Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction. Cassez, F., Jensen, P. G., & Larsen, K. G. CoRR, 2020.
Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction [link]Paper  abstract   bibtex   4 downloads  
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.
@article{DBLP:journals/corr/abs-2007-10539,
  author    = {Franck Cassez and
               Peter Gj{\o}l Jensen and
               Kim Guldstrand Larsen},
  title     = {Verification and Parameter Synthesis for Real-Time Programs using
               Refinement of Trace Abstraction},
  journal   = {CoRR},
  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.},
  volume    = {abs/2007.10539},
  year      = {2020},
  url       = {https://arxiv.org/abs/2007.10539},
  archivePrefix = {arXiv},
  eprint    = {2007.10539},
  timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2007-10539.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 4