Verification and parameter synthesis for real-time programs using refinement of trace abstraction
From MaRDI portal
Publication:4989166
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.
Recommendations
- Refinement of trace abstraction for real-time programs
- Parameter synthesis for hierarchical concurrent real-time systems
- Synthesis of timing parameters satisfying safety properties
- Verification, refinement and scheduling of real-time programs
- Integer-complete synthesis for bounded parametric timed automata
Cites work
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 1361123 (Why is no real title available?)
- scientific article; zbMATH DE number 1759608 (Why is no real title available?)
- scientific article; zbMATH DE number 2085314 (Why is no real title available?)
- A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata
- A theory of timed automata
- Abstractions for hybrid systems
- An iterative approach to precondition inference using constrained Horn clauses
- Automatic Abstraction Refinement for Timed Automata
- Formal Modeling and Analysis of Timed Systems
- Hybrid Systems: Computation and Control
- Infinite-state invariant checking with IC3 and predicate abstraction
- Refinement of Trace Abstraction
- Refinement of trace abstraction for real-time programs
- Symbolic quantitative robustness analysis of timed automata
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
- The expressive power of time Petri nets
- Tools and algorithms for the construction and analysis of systems. 25 years of TACAS: TOOLympics, held as part of ETAPS 2019, Prague, Czech Republic, April 6--11, 2019. Proceedings. Part III
- Trace abstraction refinement for timed automata
- Verification of concurrent programs using trace abstraction refinement
- What's decidable about hybrid automata?
Cited in
(3)
This page was built for publication: Verification and parameter synthesis for real-time programs using refinement of trace abstraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989166)