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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. B. Akers. Binary decision diagrams. IEEE Transactions on Computers, C-27(6), 1978.
R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677–692, 1986.
N. Halbwachs. Synchronous programming of reactive systems. Kluwer Academic Pub., 1993.
N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataflow programming language Lustre. Proceedings of the IEEE, 79(9):1305–1320, September 1991.
J.-F. Héry and J.-C. Laleuf. Stabilité de la réalisation des DFL. Technical Report Electricité de France, 1997.
N. Halbwachs and F. Maraninchi. On the symbolic analysis of combinational loops in circuits and synchronous programs. In Euromicro’95, Como (Italy), September 1995.
D. Harel and A. Naamad. The Statemate semantics of Statecharts. ACM Transactions on Software Engineering and Methodology, 5(4), October 1996.
IEC. International standard for programmable controllers: Programming languages. Technical report iec1131, part 3, International Electrotecnical Commission, 1993.
S. Malik. Analysis of cyclic combinational circuits. In ICCAD’93, Santa Clara (Ca), 1993.
K. S. Namjoshi and R. P. Kurshan. Efficient analysis of cyclic definitions. In 11th International Conference on Computer Aided Verification, CAV’99, Trento (Italy), July 1999.
A. Pnueli. The temporal logic of programs. In 18th Symp. on the Foundations of Computer Science, Providence R.I., 1977. IEEE.
T. R. Shiple, G. Berry, and H. Touati. Constructive analysis of cyclic circuits. In International Design and Testing Conference IDTC’96, Paris, France, 1996.
R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146–160, 1972.
M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Symposium on Logic in Computer Science, June 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halbwachs, N., Héry, J.F., Laleuf, J.C., Nicollin, X. (2000). Stability of Discrete Sampled Systems. In: Joseph, M. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 2000. Lecture Notes in Computer Science, vol 1926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45352-0_1
Download citation
DOI: https://doi.org/10.1007/3-540-45352-0_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41055-3
Online ISBN: 978-3-540-45352-9
eBook Packages: Springer Book Archive