Factorization-based approach for computing a minimum makespan controllable sublanguage
Carregando...
Data
Título da Revista
ISSN da Revista
Título de Volume
Editor
Universidade Federal de Minas Gerais
Descrição
Tipo
Artigo de evento
Título alternativo
Primeiro orientador
Membros da banca
Resumo
This paper proposes a decomposition-based approach for computing a controllable sublanguage with minimum makespan. It is applicable to a class of cyclic discrete event system modeled by cyclic timed automata. We introduce the notion of the symmetrically reachable idle state and show that its existence in an automaton allows to decompose a language into a concatenation of smaller languages. We also propose a new technique to compute the makespan of finite length strings. Results are illustrated with a case study of a small factory.
Abstract
Assunto
Teoria do controle, Métodos de simulação
Palavras-chave
Cylic Discrete Event Systems, Supervisory Control Theory, Minimum Makespan Controllable Sublanguage, a dynamic system where variables are characterized by sequences of discrete events that repeat in a cycle. Discrete event systems (DES) are used to model and analyze engineering systems like manufacturing, transportation, and communication networks
Citação
Departamento
Curso
Endereço externo
https://www.sciencedirect.com/science/article/pii/S2405896318305949