Notice

This is not the latest version of this item. The latest version can be found at:https://dspace.mit.edu/handle/1721.1/137970.2

Show simple item record

dc.contributor.authorCavalcanti, J.
dc.contributor.authorBalakrishnan, H.
dc.date.accessioned2021-11-09T16:38:03Z
dc.date.available2021-11-09T16:38:03Z
dc.date.issued2017-12
dc.identifier.urihttps://hdl.handle.net/1721.1/137970
dc.description.abstract© 2017 IEEE. This paper addresses the analysis of networked systems with switching topologies modeled by Positive Markov Jump Linear Systems, focusing on finite-time stability criteria. Main results are sufficient conditions to assess finite-time stability, and establish probabilistic bounds on state amplification. In addition, connections between notions of asymptotic and finite-time stability are explored. Numerical examples illustrate how the proposed criteria can help to gain insight on air traffic delay propagation, one of many real world networked systems that are amenable to the analysis herein.en_US
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionof10.1109/CDC.2017.8264639en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleFinite-time behavior of switching networksen_US
dc.typeArticleen_US
dc.identifier.citationCavalcanti, J. and Balakrishnan, H. 2017. "Finite-time behavior of switching networks."
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2019-10-23T18:13:23Z
dspace.date.submission2019-10-23T18:13:25Z
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

VersionItemDateSummary

*Selected version