Name
Abstract | ||
|---|---|---|
Real-time programs 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. We report on the implementation of our algorithm and we show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools. |
Year | Venue | Field |
|---|---|---|
2017 | RP | Abstraction,Petri net,Computer science,Automaton,Reachability,Theoretical computer science,Stopwatch |
DocType | Citations | PageRank |
Conference | 1 | 0.37 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Franck Cassez | 1 | 825 | 46.76 |
| Peter Gjøl Jensen | 2 | 32 | 9.38 |
| Kim Guldstrand Larsen | 3 | 4434 | 346.88 |