Abstract | ||
---|---|---|
We describe formal verification of some of the key algorithms in the Time-Triggered Architecture (TTA) for real-time safety-critical control applications. Some of these algorithms pose formidable challenges to current techniques and have been formally verified only in simplified form or under restricted fault assumptions. We describe what has been done and what remains to be done and indicate some directions that seem promising for the remaining cases and for increasing the automation that can be applied. We also describe the larger challenges posed by formal verification of the interaction of the constituent algorithms and of their emergent properties. |
Year | Venue | Keywords |
---|---|---|
2002 | FTRTFT | real-time safety-critical control application,constituent algorithm,current technique,remaining case,larger challenge,time-triggered architecture,formal verification,formidable challenge,emergent property,key algorithm,real time,emergent properties |
Field | DocType | ISBN |
Computer science,Byzantine fault tolerance,Real-time operating system,Linear temporal logic,Automation,Time-triggered architecture,Reactive system,Software development,Distributed computing,Formal verification | Conference | 3-540-44165-4 |
Citations | PageRank | References |
19 | 1.31 | 56 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
John Rushby | 1 | 2459 | 235.69 |