Lamperski, A (2009) Representations and algorithms for finite-state bisimulations of linear discrete-time control systems. In: UNSPECIFIED pp. 51-56..Full text not available from this repository.
While a large amount of research over the past two decades has focused on discrete abstractions of infinite-state dynamical systems, many structural and algorithmic details of these abstractions remain unknown. To clarify the computational resources needed to perform discrete abstractions, this paper examines the algorithmic properties of an existing method for deriving finite-state systems that are bisimilar to linear discrete-time control systems. We explicitly find the structure of the finite-state system, show that it can be enormous compared to the original linear system, and give conditions to guarantee that the finite-state system is reasonably sized and efficiently computable. Though constructing the finite-state system is generally impractical, we see that special cases could be amenable to satisfiability based verification techniques. ©2009 IEEE.
|Item Type:||Conference or Workshop Item (UNSPECIFIED)|
|Divisions:||Div F > Computational and Biological Learning|
|Depositing User:||Cron Job|
|Date Deposited:||09 Dec 2016 17:55|
|Last Modified:||20 Feb 2017 06:49|