Finite automata approximations with error bounds for systems with quantized actuation and measurement: a case study

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Tarraf, D.C., Megretski, A., Dahleh, M.A.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Approximation algorithms Approximation error Automata Automatic control Computer aided software engineering Computer science control theory systems Control systems Control theory. Systems Exact sciences and technology Output feedback Pervasive computing State-space methods Time measurement
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0191-2216
DOI:	10.1109/CDC.2004.1430245