scholarly journals Tropical Lexicographic Optimization: Synchronizing Timed Event Graphs

Symmetry ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 1597
Author(s):  
Alan Mendes Marotta ◽  
Vinicius Mariano Gonçalves ◽  
Carlos Andrey Maia

Tropical Algebra is used to model the dynamics of Timed Event Graphs (TEG), a particular class of Timed Discrete-Event System (TDES) in which we are interested only in synchronization and delay phenomena. Whenever this TEG has control inputs, we can use them to control the synchronization of the system to achieve some objective. Thus, this paper formulates a framework based on tropical algebra and lexicographic optimization to synchronize a TEG when dealing with many synchronization objectives that are ranked in previous priority order. We call this kind of problem the Tropical Lexicographic Synchronization Optimization (TLSO). This work develops a solution to this problem, based on Tropical Fractional Linear Programming (TFLP) and lexicographic optimization concepts. In this way, the basics of tropical algebra are determined, including essential terms to this paper, such as left and right residuations, and the following stages of the solution to the TLSO problem are explained. Therefore, this work presents a general framework based on structured algebraic models with application to TEG synchronization. By synchronization, we mean balancing and organizing events chronologically in order to achieve the desired goal. So, we are dealing with concepts closely related to symmetry ones. An illustrative numerical example is presented, which demonstrates the implementation of the proposed algorithms. The acquired results confirm the efficiency of the proposed methodology. Codes used for implementing the algorithms are listed in the appendix section of the article.

2021 ◽  
Vol 11 (11) ◽  
pp. 4769
Author(s):  
Ja-Hee Kim

Designing a discrete event system converging to steady temporal patterns is an essential issue of a system with time window constraints. Until now, to analyze asymptotic stability, we have modeled a timed event graph’s dynamic behavior, transformed it into the matrix form of (max,+) algebra, and then constructed a precedence graph. This article’s aim is to provide a theoretical basis for analyzing the stability and cyclicity of timed event graphs without using (max,+) algebra. In this article, we propose converting one timed event graph to another with a dynamic behavior equivalent to that of the original without going through the conversion process. This paper also guarantees that the derived final timed event graph has the properties of a precedence graph. It then investigates the relationship between the properties of the derived precedence graph and that of the original timed event graph. Finally, we propose a method to analyze asymptotic cyclicity and stability for a given timed event graph by itself. The analysis this article provides makes it easy to analyze and improve asymptotic time patterns of tasks in a given discrete event system modeled with a live autonomous timed event graph such as repetitive production scheduling.


Sign in / Sign up

Export Citation Format

Share Document