Skip to main content
Abstractions of Constrained Linear Systems
Departmental Papers (ESE)
  • Herbert G Tanner, University of Pennsylvania
  • George J Pappas, University of Pennsylvania
Document Type
Conference Paper
Date of this Version
Copyright 2003 IEEE. Reprinted from Proceedings of the American Control Conference 2003, Volume 4, pages 3381-3386.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Simulation relations are powerful abstraction techniques in computer science that reduce the complexity of analysis and design of labeled transition systems. In this paper, we define and characterize simulation relations for discrete-time linear systems in the presence of state and input constraints. Given a discrete-time linear system and the associated constraints, we consider a control-abstract embedding into a transition system. We then establish necessary and sufficient conditions for one constrained linear system to simulate the transitions of the other. Checking the simulation conditions is formulated as a linear programming problem which can be efficiently solved for systems of large dimensions. We provide an example where our approach is applied to the hybrid model of the Electronic Throttle Control (ETC) System.
Citation Information
Herbert G Tanner and George J Pappas. "Abstractions of Constrained Linear Systems" (2003)
Available at: