A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Finite automata approximations with error bounds for systems with quantized actuation and measurement: a case study
2004
2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)
We consider stable, discrete time, first order LTI systems with finite input alphabets and quantized outputs. We propose an algorithm for generating deterministic finite state machine approximations of these systems with computable bounds on approximation error, and we describe the conditions under which the bounds are valid.
doi:10.1109/cdc.2004.1430245
fatcat:hqwddtdgcjdl3ez6fmzc5mopj4