Stability of Discrete Sampled Systems

Authors:
Nicolas Halbwachs;J.-F. Héry;J.-C. Laleuf;Xavier Nicollin
Affiliations:
-;-;-;-
Venue:
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Year:
2000

Citing 7
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The STATEMATE semantics of statecharts

ACM Transactions on Software Engineering and Methodology (TOSEM)
Analysis of cyclic combinational circuits

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Synchronous Programming of Reactive Systems

Synchronous Programming of Reactive Systems
Constructive Analysis of Cyclic Circuits

EDTC '96 Proceedings of the 1996 European conference on Design and Test
Binary Decision Diagrams

IEEE Transactions on Computers
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.