Prototyping of Concurrent Control Systems with Application of Petri Nets and Comparability Graphs
Autor(a) principal: | |
---|---|
Data de Publicação: | 2018 |
Outros Autores: | , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | https://doi.org/10.1109/TCST.2017.2692204 |
Resumo: | This paper shows a novel prototyping technique for concurrent control systems described by interpreted Petri nets. The technique is based on the decomposition of an interpreted Petri net into concurrent sequential automata. In general, minimum decomposition requires runtime that is exponential in the number of Petri net places. We show that in many cases, including the real-life ones, the minimum decomposition problem can be solved in polynomial time. The proposed method allows implementing a concurrent control system using minimal number of sequential components, which requires polynomial time and can be applied to most of the considered cases. The presented concept is illustrated by a real-life industrial example of a beverage production and distribution machine implemented in a field programmable gate array. |
id |
RCAP_97d04330a9319e304c32aeedff4e68a4 |
---|---|
oai_identifier_str |
oai:run.unl.pt:10362/65255 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Prototyping of Concurrent Control Systems with Application of Petri Nets and Comparability GraphsComparability graphsConcurrent control systemsField-programmable gate array (FPGA)Petri netsControl and Systems EngineeringElectrical and Electronic EngineeringThis paper shows a novel prototyping technique for concurrent control systems described by interpreted Petri nets. The technique is based on the decomposition of an interpreted Petri net into concurrent sequential automata. In general, minimum decomposition requires runtime that is exponential in the number of Petri net places. We show that in many cases, including the real-life ones, the minimum decomposition problem can be solved in polynomial time. The proposed method allows implementing a concurrent control system using minimal number of sequential components, which requires polynomial time and can be applied to most of the considered cases. The presented concept is illustrated by a real-life industrial example of a beverage production and distribution machine implemented in a field programmable gate array.DEE2010-C1 Sistemas Digitais e PercepcionaisDEE - Departamento de Engenharia Electrotécnica e de ComputadoresCTS - Centro de Tecnologia e SistemasUNINOVA-Instituto de Desenvolvimento de Novas TecnologiasRUNWisniewski, RemigiuszKaratkevich, AndreiAdamski, MarianCosta, AnikoGomes, Luis2019-04-01T22:02:31Z2018-03-012018-03-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article12application/pdfhttps://doi.org/10.1109/TCST.2017.2692204eng1063-6536PURE: 3898053http://www.scopus.com/inward/record.url?scp=85018930762&partnerID=8YFLogxKhttps://doi.org/10.1109/TCST.2017.2692204info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-03-11T04:31:00Zoai:run.unl.pt:10362/65255Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:34:17.267459Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Prototyping of Concurrent Control Systems with Application of Petri Nets and Comparability Graphs |
title |
Prototyping of Concurrent Control Systems with Application of Petri Nets and Comparability Graphs |
spellingShingle |
Prototyping of Concurrent Control Systems with Application of Petri Nets and Comparability Graphs Wisniewski, Remigiusz Comparability graphs Concurrent control systems Field-programmable gate array (FPGA) Petri nets Control and Systems Engineering Electrical and Electronic Engineering |
title_short |
Prototyping of Concurrent Control Systems with Application of Petri Nets and Comparability Graphs |
title_full |
Prototyping of Concurrent Control Systems with Application of Petri Nets and Comparability Graphs |
title_fullStr |
Prototyping of Concurrent Control Systems with Application of Petri Nets and Comparability Graphs |
title_full_unstemmed |
Prototyping of Concurrent Control Systems with Application of Petri Nets and Comparability Graphs |
title_sort |
Prototyping of Concurrent Control Systems with Application of Petri Nets and Comparability Graphs |
author |
Wisniewski, Remigiusz |
author_facet |
Wisniewski, Remigiusz Karatkevich, Andrei Adamski, Marian Costa, Aniko Gomes, Luis |
author_role |
author |
author2 |
Karatkevich, Andrei Adamski, Marian Costa, Aniko Gomes, Luis |
author2_role |
author author author author |
dc.contributor.none.fl_str_mv |
DEE2010-C1 Sistemas Digitais e Percepcionais DEE - Departamento de Engenharia Electrotécnica e de Computadores CTS - Centro de Tecnologia e Sistemas UNINOVA-Instituto de Desenvolvimento de Novas Tecnologias RUN |
dc.contributor.author.fl_str_mv |
Wisniewski, Remigiusz Karatkevich, Andrei Adamski, Marian Costa, Aniko Gomes, Luis |
dc.subject.por.fl_str_mv |
Comparability graphs Concurrent control systems Field-programmable gate array (FPGA) Petri nets Control and Systems Engineering Electrical and Electronic Engineering |
topic |
Comparability graphs Concurrent control systems Field-programmable gate array (FPGA) Petri nets Control and Systems Engineering Electrical and Electronic Engineering |
description |
This paper shows a novel prototyping technique for concurrent control systems described by interpreted Petri nets. The technique is based on the decomposition of an interpreted Petri net into concurrent sequential automata. In general, minimum decomposition requires runtime that is exponential in the number of Petri net places. We show that in many cases, including the real-life ones, the minimum decomposition problem can be solved in polynomial time. The proposed method allows implementing a concurrent control system using minimal number of sequential components, which requires polynomial time and can be applied to most of the considered cases. The presented concept is illustrated by a real-life industrial example of a beverage production and distribution machine implemented in a field programmable gate array. |
publishDate |
2018 |
dc.date.none.fl_str_mv |
2018-03-01 2018-03-01T00:00:00Z 2019-04-01T22:02:31Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://doi.org/10.1109/TCST.2017.2692204 |
url |
https://doi.org/10.1109/TCST.2017.2692204 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
1063-6536 PURE: 3898053 http://www.scopus.com/inward/record.url?scp=85018930762&partnerID=8YFLogxK https://doi.org/10.1109/TCST.2017.2692204 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
12 application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799137964379340800 |