Equivalence of switching linear systems by bisimulation

Share/Save/Bookmark

Pola, G. and Schaft van der, A.J. and Benedetto Di, M.D. (2006) Equivalence of switching linear systems by bisimulation. International Journal of Control, 79 (1). pp. 74-92. ISSN 0020-7179

[img]
Preview
PDF
366Kb
Abstract:A general notion of hybrid bisimulation is proposed for the class of switching linear systems. Connections between the notions of bisimulation-based equivalence, state-space equivalence, algebraic and input–output equivalence are investigated. An algebraic characterization of hybrid bisimulation and an algorithmic procedure converging in a finite number of steps to the maximal hybrid bisimulation are derived. Hybrid state space reduction is performed by hybrid bisimulation between the hybrid system and itself. By specializing the results obtained on bisimulation, also characterizations of simulation and abstraction are derived. Connections between observability, bisimulation-based reduction and simulation-based abstraction are studied.

Item Type:Article
Copyright:© 2006 Taylor & Francis
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66718
Official URL:http://dx.doi.org/10.1080/00207170500380839
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 237777