Synthesis of supervisors for time-varying discrete event systems
Autor(a) principal: | |
---|---|
Data de Publicação: | 2004 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Sba: Controle & Automação Sociedade Brasileira de Automatica |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-17592004000400002 |
Resumo: | We introduce a time-varying automaton to model discrete event systems. The structure of this time-varying automaton is very similar structure to (max,+) automaton, but allowing variable event lifetimes. Based on this time-varying automaton the design of timed supervisors is obtained by using the dioid algebra, where the languages used to describe the discrete event system as well the desired specification are replaced by matrices defined in such algebra and the supervisor synthesis is achieved through simple matrix operations. The proposed synthesis algorithm allows one to synthesize supervisors for un-timed DES, timed DES with constant event lifetime and timed DES with variable event lifetime. All these cases are treated with the same basic algorithm, the differences rely only on the definition of the event lifetime functions. The proposed algorithm presents a complexity order equal to the supervisor synthesis algorithm of un-timed discrete event systems. The proposed approach can be considered as an alternative procedure, based on a non-traditional algebraic structure, to achieve the supervisor synthesis for discrete event systems. |
id |
SBA-2_983fdeb071ffca1d7c8e31f9f3be9d7f |
---|---|
oai_identifier_str |
oai:scielo:S0103-17592004000400002 |
network_acronym_str |
SBA-2 |
network_name_str |
Sba: Controle & Automação Sociedade Brasileira de Automatica |
repository_id_str |
|
spelling |
Synthesis of supervisors for time-varying discrete event systemsTime-Varying Automatadiscrete event systemssupervisory controlWe introduce a time-varying automaton to model discrete event systems. The structure of this time-varying automaton is very similar structure to (max,+) automaton, but allowing variable event lifetimes. Based on this time-varying automaton the design of timed supervisors is obtained by using the dioid algebra, where the languages used to describe the discrete event system as well the desired specification are replaced by matrices defined in such algebra and the supervisor synthesis is achieved through simple matrix operations. The proposed synthesis algorithm allows one to synthesize supervisors for un-timed DES, timed DES with constant event lifetime and timed DES with variable event lifetime. All these cases are treated with the same basic algorithm, the differences rely only on the definition of the event lifetime functions. The proposed algorithm presents a complexity order equal to the supervisor synthesis algorithm of un-timed discrete event systems. The proposed approach can be considered as an alternative procedure, based on a non-traditional algebraic structure, to achieve the supervisor synthesis for discrete event systems.Sociedade Brasileira de Automática2004-12-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-17592004000400002Sba: Controle & Automação Sociedade Brasileira de Automatica v.15 n.4 2004reponame:Sba: Controle & Automação Sociedade Brasileira de Automaticainstname:Sociedade Brasileira de Automática (SBA)instacron:SBA10.1590/S0103-17592004000400002info:eu-repo/semantics/openAccessCosta,Eduard Montgomery MeiraLima,Antonio Marcus Nogueiraeng2005-02-11T00:00:00Zoai:scielo:S0103-17592004000400002Revistahttps://www.sba.org.br/revista/PUBhttps://old.scielo.br/oai/scielo-oai.php||revista_sba@fee.unicamp.br1807-03450103-1759opendoar:2005-02-11T00:00Sba: Controle & Automação Sociedade Brasileira de Automatica - Sociedade Brasileira de Automática (SBA)false |
dc.title.none.fl_str_mv |
Synthesis of supervisors for time-varying discrete event systems |
title |
Synthesis of supervisors for time-varying discrete event systems |
spellingShingle |
Synthesis of supervisors for time-varying discrete event systems Costa,Eduard Montgomery Meira Time-Varying Automata discrete event systems supervisory control |
title_short |
Synthesis of supervisors for time-varying discrete event systems |
title_full |
Synthesis of supervisors for time-varying discrete event systems |
title_fullStr |
Synthesis of supervisors for time-varying discrete event systems |
title_full_unstemmed |
Synthesis of supervisors for time-varying discrete event systems |
title_sort |
Synthesis of supervisors for time-varying discrete event systems |
author |
Costa,Eduard Montgomery Meira |
author_facet |
Costa,Eduard Montgomery Meira Lima,Antonio Marcus Nogueira |
author_role |
author |
author2 |
Lima,Antonio Marcus Nogueira |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Costa,Eduard Montgomery Meira Lima,Antonio Marcus Nogueira |
dc.subject.por.fl_str_mv |
Time-Varying Automata discrete event systems supervisory control |
topic |
Time-Varying Automata discrete event systems supervisory control |
description |
We introduce a time-varying automaton to model discrete event systems. The structure of this time-varying automaton is very similar structure to (max,+) automaton, but allowing variable event lifetimes. Based on this time-varying automaton the design of timed supervisors is obtained by using the dioid algebra, where the languages used to describe the discrete event system as well the desired specification are replaced by matrices defined in such algebra and the supervisor synthesis is achieved through simple matrix operations. The proposed synthesis algorithm allows one to synthesize supervisors for un-timed DES, timed DES with constant event lifetime and timed DES with variable event lifetime. All these cases are treated with the same basic algorithm, the differences rely only on the definition of the event lifetime functions. The proposed algorithm presents a complexity order equal to the supervisor synthesis algorithm of un-timed discrete event systems. The proposed approach can be considered as an alternative procedure, based on a non-traditional algebraic structure, to achieve the supervisor synthesis for discrete event systems. |
publishDate |
2004 |
dc.date.none.fl_str_mv |
2004-12-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-17592004000400002 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0103-17592004000400002 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/S0103-17592004000400002 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Automática |
publisher.none.fl_str_mv |
Sociedade Brasileira de Automática |
dc.source.none.fl_str_mv |
Sba: Controle & Automação Sociedade Brasileira de Automatica v.15 n.4 2004 reponame:Sba: Controle & Automação Sociedade Brasileira de Automatica instname:Sociedade Brasileira de Automática (SBA) instacron:SBA |
instname_str |
Sociedade Brasileira de Automática (SBA) |
instacron_str |
SBA |
institution |
SBA |
reponame_str |
Sba: Controle & Automação Sociedade Brasileira de Automatica |
collection |
Sba: Controle & Automação Sociedade Brasileira de Automatica |
repository.name.fl_str_mv |
Sba: Controle & Automação Sociedade Brasileira de Automatica - Sociedade Brasileira de Automática (SBA) |
repository.mail.fl_str_mv |
||revista_sba@fee.unicamp.br |
_version_ |
1754824564295073792 |