Bisimilar linear systems

doi:10.1016/j.automatica.2003.07.003

Return

Bisimilar linear systems

2003-12-01

168

PRE

George J. Pappas *

DOI：10.1016/j.automatica.2003.07.003

Original

Original request for help

Save

Abstract

En 中文

The notion of bisimulation in theoretical computer science is one of the main complexity reduction methods for the analysis and synthesis of labeled transition systems. Bisimulations are special quotients of the state space that preserve many important properties expressible in temporal logics, and, in particular, reachability. In this paper, the framework of bisimilar transition systems is applied to various transition systems that are generated by linear control systems. Given a discrete-time or continuous-time linear system, and a finite observation map, we characterize linear quotient maps that result in quotient transition systems that are bisimilar to the original system. Interestingly, the characterizations for discrete-time systems are more restrictive than for continuous-time systems, due to the existence of an atomic time step. We show that computing the coarsest bisimulation, which results in maximum complexity reduction, corresponds to computing the maximal controlled or reachability invariant subspace inside the kernel of the observations map. These results establish strong connections between complexity reduction concepts in control theory and computer science. (C) 2003 Elsevier Ltd. All rights reserved.

Keywords:

bisimulation

linear systems

reachability

transition systems

control invariance

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.