Name
Abstract | ||
|---|---|---|
We consider the wide class of real-time systems that periodically sample their inputs. A desirable property of such systems is that their outputs should be, in some sense, more precise when the sampling period gets shorter. An approximation of this property consists in requiring that, whenever the inputs don't change, the outputs stabilize after a finite number of steps. We present a set of heuristics to check this stability property, in the case of purely Boolean systems. These heuristics have been experimented on a nuclear plant control software, and have been shown to dramatically reduce the cost of stability analysis. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-45352-0_1 | FTRTFT |
Keywords | Field | DocType |
finite number,stability analysis,boolean system,stability property,desirable property,wide class,sampling period,discrete sampled systems,nuclear plant control software,real-time system,real time systems | Boolean function,Finite set,Control theory,Binary decision diagram,Real-time operating system,Heuristics,Boolean algebra,Sampling (statistics),Discrete system,Mathematics | Conference |
Volume | ISSN | ISBN |
1926 | 0302-9743 | 3-540-41055-4 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Halbwachs | 1 | 3957 | 426.43 |
| J.-F. Héry | 2 | 0 | 0.34 |
| J.-C. Laleuf | 3 | 0 | 0.34 |
| Xavier Nicollin | 4 | 1276 | 185.73 |