Finite automata approximations with error bounds for systems with quantized actuation and measurement: a case study
Danielle C. Tarraf, Alexandre Megretski, Munther A. Dahleh · 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) · 2004
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.