Show simple item record

dc.contributor.authorGol, Ebru Aydinen_US
dc.contributor.authorDing, Xuchuen_US
dc.contributor.authorLazar, Mirceaen_US
dc.contributor.authorBelta, Calinen_US
dc.coverage.spatialHIen_US
dc.date.accessioned2018-07-12T14:12:09Z
dc.date.available2018-07-12T14:12:09Z
dc.date.issued2012-01-01
dc.identifierhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000327200407138&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=6e74115fe3da270499c3d65c9b17d654
dc.identifier.citationEbru Aydin Gol, Xuchu Ding, Mircea Lazar, Calin Belta. 2012. "Finite Bisimulations for Switched Linear Systems." 2012 IEEE 51ST ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), pp. 7632 - 7637 (6).
dc.identifier.issn0743-1546
dc.identifier.urihttps://hdl.handle.net/2144/29844
dc.description.abstractIn this paper, we consider the problem of constructing a finite bisimulation quotient for a discrete-time switched linear system in a bounded subset of its state space. Given a set of observations over polytopic subsets of the state space and a switched linear system with stable subsystems, the proposed algorithm generates the bisimulation quotient in a finite number of steps with the aid of sublevel sets of a polyhedral Lyapunov function. Starting from a sublevel set that includes the origin in its interior, the proposed algorithm iteratively constructs the bisimulation quotient for the region bounded by any larger sublevel set. We show how this bisimulation quotient can be used for synthesis of switching laws and verification with respect to specifications given as syntactically co-safe Linear Temporal Logic formulae over the observed polytopic subsets.en_US
dc.description.sponsorshipThis work was partially supported by the NSF under grants CNS-0834260 and CNS-1035588 and by the ONR under grant MURI N00014-09-1051 at Boston University, and by Veni grant 10230 at Eindhoven University of Technology. Recommended by Associate Editor G. J. Pappas. (CNS-0834260 - NSF; CNS-1035588 - NSF; MURI N00014-09-1051 - ONR; Boston University)en_US
dc.description.urihttps://pure.tue.nl/ws/files/3936766/388348599894296.pdf
dc.format.extentp. 7632-7637en_US
dc.languageEnglish
dc.publisherIEEEen_US
dc.relation.ispartof2012 IEEE 51ST ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC)
dc.rights0018-9286 © 2014 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.en_US
dc.subjectScience & technologyen_US
dc.subjectAutomation & control systemsen_US
dc.subjectComputer science, artificial intelligenceen_US
dc.subjectEngineering, electrical & electronicen_US
dc.subjectComputer scienceen_US
dc.subjectSafety propertiesen_US
dc.subjectModel checkingen_US
dc.subjectLogicen_US
dc.subjectLyapunov methodsen_US
dc.subjectFinite bisimulation quotienten_US
dc.subjectState spaceen_US
dc.subjectDiscrete-time switched linear systemen_US
dc.titleFinite bisimulations for switched linear systemsen_US
dc.typeArticleen_US
dc.description.versionPublished versionen_US
dc.identifier.doi10.1109/TAC.2014.2351653
pubs.elements-sourceweb-of-scienceen_US
pubs.notesEmbargo: Not knownen_US
pubs.organisational-groupBoston Universityen_US
pubs.organisational-groupBoston University, College of Engineeringen_US
pubs.organisational-groupBoston University, College of Engineering, Department of Mechanical Engineeringen_US
pubs.publication-statusPublisheden_US


This item appears in the following Collection(s)

Show simple item record