Finite bisimulations of controllable linear systems

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

[1]  Pavol Brunovský,et al.  A classification of linear controllable systems , 1970, Kybernetika.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[4]  S. Shankar Sastry,et al.  O-Minimal Hybrid Systems , 2000, Math. Control. Signals Syst..

[5]  S. Sastry,et al.  Decidable and semi-decidable controller synthesis for classes of discrete time hybrid systems , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[6]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[7]  Alberto Bemporad,et al.  Control of systems integrating logic, dynamics, and constraints , 1999, Autom..

[8]  Jan H. van Schuppen,et al.  Control of Piecewise-Linear Hybrid Systems on Simplices and Rectangles , 2001, HSCC.

[9]  Paulo Tabuada,et al.  From discrete specifications to hybrid control , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[10]  Panos J. Antsaklis,et al.  An invariant‐based approach to the design of hybrid control systems , 2001 .

[11]  B. Krogh,et al.  Synthesis of supervisory controllers for hybrid systems based on approximating automata , 1998, IEEE Trans. Autom. Control..

[12]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

[13]  Paulo Tabuada,et al.  Model Checking LTL over Controllable Linear Systems Is Decidable , 2003, HSCC.

[14]  Mireille E. Broucke.  A Geometric Approach to Bisimulation and Verification of Hybrid Systems , 1999, HSCC.

[15]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[16]  Jennifer M. Davoren,et al.  Robust Controller Synthesis for Hybrid Systems Using Modal Logic , 2001, HSCC.