Tabuada, PauloPappas, George J2023-05-222023-05-222003-12-092005-05-25https://repository.upenn.edu/handle/20.500.14332/34145Finite abstractions of infinite state models have been critical in enabling and applying formal and algorithmic verification methods to continuous and hybrid systems. This has triggered the study and characterization of classes of continuous dynamics which can be abstracted by finite transition systems. In this paper, we focus on synthesis rather than analysis. In this spirit, we show that given any discrete-time, linear control system satisfying a generic controllability property, and any finite set of observations restricted to the boolean algebra of Brunovsky sets, a finite bisimulation always exists and can be effectively computed.GRASPPresentation