Robustness of supervisors for discrete-event systems
Supervisory control in the context of /spl omega/-languages is considered. The nominal supervisor design problem is to find a non-blocking supervisor for a nominal plant such that the closed-loop infinite behavior equals a specified closed-loop behavior. The robustness of solutions to the nominal pr...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on automatic control 1999-02, Vol.44 (2), p.376-379 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 379 |
|---|---|
| container_issue | 2 |
| container_start_page | 376 |
| container_title | IEEE transactions on automatic control |
| container_volume | 44 |
| creator | Cury, J.E.R. Krogh, B.H. |
| description | Supervisory control in the context of /spl omega/-languages is considered. The nominal supervisor design problem is to find a non-blocking supervisor for a nominal plant such that the closed-loop infinite behavior equals a specified closed-loop behavior. The robustness of solutions to the nominal problem is defined with respect to variations in the plant. It is shown there exists a supervisor solving the nominal problem which maximizes the set of plants for which the closed-loop languages for all other plants in the set satisfy lower and upper bounds in the sense of language containment. Computational issues are discussed and the theoretical results are illustrated with an example. |
| doi_str_mv | 10.1109/9.746270 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_9_746270</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>746270</ieee_id><sourcerecordid>28518205</sourcerecordid><originalsourceid>FETCH-LOGICAL-c367t-392c25cbcf3e0e4728ceac3ca03393235f8344dc09d66450cb0c2245a498e8e13</originalsourceid><addsrcrecordid>eNqN0E1LAzEQBuAgCtYqePa0B1EvW_O9yVGKX1AQRM8hTSewst3UzG7Bf--WLXoTT8MwDy_DS8g5ozPGqL21s0pqXtEDMmFKmZIrLg7JhFJmSsuNPiYniB_DqqVkEyJf07LHrgXEIsUC-w3kbY0pYxFTLlY1hgwdlLCFtivwCztY4yk5ir5BONvPKXl_uH-bP5WLl8fn-d2iDEJXXSksD1yFZYgCKMiKmwA-iOCpEFZwoaIRUq4CtSutpaJhSQPnUnlpDRhgYkqux9xNTp89YOfWwz_QNL6F1KOzzFqmtdnJqz8lt5RVQv0DGsUMp2qANyMMOSFmiG6T67XPX45Rt2vaWTc2PdDLfabH4JuYfRtq_PXaamZ2iRcjqwHg57rP-Ab_8IQC</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28518205</pqid></control><display><type>article</type><title>Robustness of supervisors for discrete-event systems</title><source>IEEE Electronic Library (IEL)</source><creator>Cury, J.E.R. ; Krogh, B.H.</creator><creatorcontrib>Cury, J.E.R. ; Krogh, B.H.</creatorcontrib><description>Supervisory control in the context of /spl omega/-languages is considered. The nominal supervisor design problem is to find a non-blocking supervisor for a nominal plant such that the closed-loop infinite behavior equals a specified closed-loop behavior. The robustness of solutions to the nominal problem is defined with respect to variations in the plant. It is shown there exists a supervisor solving the nominal problem which maximizes the set of plants for which the closed-loop languages for all other plants in the set satisfy lower and upper bounds in the sense of language containment. Computational issues are discussed and the theoretical results are illustrated with an example.</description><identifier>ISSN: 0018-9286</identifier><identifier>EISSN: 1558-2523</identifier><identifier>DOI: 10.1109/9.746270</identifier><identifier>CODEN: IETAA9</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Automatic control ; Computer science; control theory; systems ; Containment ; Control system synthesis ; Control theory. Systems ; Design engineering ; Discrete event systems ; Exact sciences and technology ; Mathematical models ; Robust control ; Robustness ; Supervisors ; Supervisory control ; Upper bound ; Upper bounds</subject><ispartof>IEEE transactions on automatic control, 1999-02, Vol.44 (2), p.376-379</ispartof><rights>1999 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c367t-392c25cbcf3e0e4728ceac3ca03393235f8344dc09d66450cb0c2245a498e8e13</citedby><cites>FETCH-LOGICAL-c367t-392c25cbcf3e0e4728ceac3ca03393235f8344dc09d66450cb0c2245a498e8e13</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/746270$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27923,27924,54757</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/746270$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1696185$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Cury, J.E.R.</creatorcontrib><creatorcontrib>Krogh, B.H.</creatorcontrib><title>Robustness of supervisors for discrete-event systems</title><title>IEEE transactions on automatic control</title><addtitle>TAC</addtitle><description>Supervisory control in the context of /spl omega/-languages is considered. The nominal supervisor design problem is to find a non-blocking supervisor for a nominal plant such that the closed-loop infinite behavior equals a specified closed-loop behavior. The robustness of solutions to the nominal problem is defined with respect to variations in the plant. It is shown there exists a supervisor solving the nominal problem which maximizes the set of plants for which the closed-loop languages for all other plants in the set satisfy lower and upper bounds in the sense of language containment. Computational issues are discussed and the theoretical results are illustrated with an example.</description><subject>Applied sciences</subject><subject>Automatic control</subject><subject>Computer science; control theory; systems</subject><subject>Containment</subject><subject>Control system synthesis</subject><subject>Control theory. Systems</subject><subject>Design engineering</subject><subject>Discrete event systems</subject><subject>Exact sciences and technology</subject><subject>Mathematical models</subject><subject>Robust control</subject><subject>Robustness</subject><subject>Supervisors</subject><subject>Supervisory control</subject><subject>Upper bound</subject><subject>Upper bounds</subject><issn>0018-9286</issn><issn>1558-2523</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqN0E1LAzEQBuAgCtYqePa0B1EvW_O9yVGKX1AQRM8hTSewst3UzG7Bf--WLXoTT8MwDy_DS8g5ozPGqL21s0pqXtEDMmFKmZIrLg7JhFJmSsuNPiYniB_DqqVkEyJf07LHrgXEIsUC-w3kbY0pYxFTLlY1hgwdlLCFtivwCztY4yk5ir5BONvPKXl_uH-bP5WLl8fn-d2iDEJXXSksD1yFZYgCKMiKmwA-iOCpEFZwoaIRUq4CtSutpaJhSQPnUnlpDRhgYkqux9xNTp89YOfWwz_QNL6F1KOzzFqmtdnJqz8lt5RVQv0DGsUMp2qANyMMOSFmiG6T67XPX45Rt2vaWTc2PdDLfabH4JuYfRtq_PXaamZ2iRcjqwHg57rP-Ab_8IQC</recordid><startdate>19990201</startdate><enddate>19990201</enddate><creator>Cury, J.E.R.</creator><creator>Krogh, B.H.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>H8D</scope><scope>F28</scope></search><sort><creationdate>19990201</creationdate><title>Robustness of supervisors for discrete-event systems</title><author>Cury, J.E.R. ; Krogh, B.H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c367t-392c25cbcf3e0e4728ceac3ca03393235f8344dc09d66450cb0c2245a498e8e13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Applied sciences</topic><topic>Automatic control</topic><topic>Computer science; control theory; systems</topic><topic>Containment</topic><topic>Control system synthesis</topic><topic>Control theory. Systems</topic><topic>Design engineering</topic><topic>Discrete event systems</topic><topic>Exact sciences and technology</topic><topic>Mathematical models</topic><topic>Robust control</topic><topic>Robustness</topic><topic>Supervisors</topic><topic>Supervisory control</topic><topic>Upper bound</topic><topic>Upper bounds</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cury, J.E.R.</creatorcontrib><creatorcontrib>Krogh, B.H.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Aerospace Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><jtitle>IEEE transactions on automatic control</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cury, J.E.R.</au><au>Krogh, B.H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Robustness of supervisors for discrete-event systems</atitle><jtitle>IEEE transactions on automatic control</jtitle><stitle>TAC</stitle><date>1999-02-01</date><risdate>1999</risdate><volume>44</volume><issue>2</issue><spage>376</spage><epage>379</epage><pages>376-379</pages><issn>0018-9286</issn><eissn>1558-2523</eissn><coden>IETAA9</coden><abstract>Supervisory control in the context of /spl omega/-languages is considered. The nominal supervisor design problem is to find a non-blocking supervisor for a nominal plant such that the closed-loop infinite behavior equals a specified closed-loop behavior. The robustness of solutions to the nominal problem is defined with respect to variations in the plant. It is shown there exists a supervisor solving the nominal problem which maximizes the set of plants for which the closed-loop languages for all other plants in the set satisfy lower and upper bounds in the sense of language containment. Computational issues are discussed and the theoretical results are illustrated with an example.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/9.746270</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9286 |
| ispartof | IEEE transactions on automatic control, 1999-02, Vol.44 (2), p.376-379 |
| issn | 0018-9286 1558-2523 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_9_746270 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Automatic control Computer science control theory systems Containment Control system synthesis Control theory. Systems Design engineering Discrete event systems Exact sciences and technology Mathematical models Robust control Robustness Supervisors Supervisory control Upper bound Upper bounds |
| title | Robustness of supervisors for discrete-event systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T14%3A08%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Robustness%20of%20supervisors%20for%20discrete-event%20systems&rft.jtitle=IEEE%20transactions%20on%20automatic%20control&rft.au=Cury,%20J.E.R.&rft.date=1999-02-01&rft.volume=44&rft.issue=2&rft.spage=376&rft.epage=379&rft.pages=376-379&rft.issn=0018-9286&rft.eissn=1558-2523&rft.coden=IETAA9&rft_id=info:doi/10.1109/9.746270&rft_dat=%3Cproquest_RIE%3E28518205%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28518205&rft_id=info:pmid/&rft_ieee_id=746270&rfr_iscdi=true |