Name
Abstract | ||
|---|---|---|
We introduce the novel notion of quasi-equal clocks and use it to improve the verification time of networks of timed automata. Intuitively, two clocks are quasi-equal if, during each run of the system, they have the same valuation except for those points in time where they are reset. We propose a transformation that takes a network of timed automata and yields a network of timed automata which has a smaller set of clocks and preserves properties up to those not comparing quasi-equal clocks. Our experiments demonstrate that the verification time in three transformed real world examples is much lower compared to the original. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33365-1_12 | FORMATS |
Keywords | Field | DocType |
quasi-equal clock,real world example,novel notion,verification time,smaller set | Computer science,Automaton,Algorithm,Theoretical computer science,Timed automaton,Broadcast channels | Conference |
Citations | PageRank | References |
9 | 0.52 | 15 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian Herrera | 1 | 18 | 2.42 |
| Bernd Westphal | 2 | 43 | 8.45 |
| Sergio Feo-Arenis | 3 | 21 | 4.00 |
| Marco Muñiz | 4 | 54 | 5.68 |
| Andreas Podelski | 5 | 2760 | 197.87 |