Equivalence of switching linear systems by bisimulation

G. Pola*, A.J. van der Schaft, M.D. Di Benedetto

*Corresponding author for this work

    Research output: Contribution to journalArticleProfessional

    23 Citations (Scopus)
    107 Downloads (Pure)

    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.
    Original languageEnglish
    Pages (from-to)74-92
    Number of pages19
    JournalInternational journal of control
    Volume79
    Issue numbersuppl 2/1
    DOIs
    Publication statusPublished - 2006

    Keywords

    • EC Grant Agreement nr.: FP6/511368

    Fingerprint

    Dive into the research topics of 'Equivalence of switching linear systems by bisimulation'. Together they form a unique fingerprint.

    Cite this