Name
Abstract | ||
|---|---|---|
In this article, we focus on efficient synthesis of fault-tolerant timed models from their fault-intolerant version. Although the complexity of the synthesis problem is known to be polynomial time in the size of the time-abstract bisimulation of the input model, the state of the art currently lacks synthesis algorithms that can be efficiently implemented. This is in part due to the fact that synth... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TDSC.2016.2596719 | IEEE Transactions on Dependable and Secure Computing |
Keywords | Field | DocType |
Automata,Clocks,Fault tolerance,Fault tolerant systems,Timing,Circuit faults,Cost accounting | Stuck-at fault,Fault coverage,Computer science,Automaton,Software fault tolerance,Real-time computing,Fault tolerance,Timed automaton,Bisimulation,Time complexity,Distributed computing | Journal |
Volume | Issue | ISSN |
15 | 3 | 1545-5971 |
Citations | PageRank | References |
1 | 0.36 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fathiyeh Faghih | 1 | 11 | 4.33 |
| Borzoo Bonakdarpour | 2 | 490 | 45.02 |