scholarly journals Max-Plus Linear Equation System and Its Application on Railway Network System

2020 ◽  
Vol 2 (1) ◽  
Author(s):  
Andro Kurniawan ◽  
Ari Suparwanto

Max-Plus algebra is the set of R U {-~} with R is the set of all real numbersthat are equipped with maximum operation and addition. Max-Plus algebra is able tomodel several types of Discrete Event System (DES) which are nonlinear in conventional algebra to be linear in Max-Plus algebra, so we can do further analysis of the system. Types of DES will be linear in the form of Max-Plus algebra which only synchronizes without any concurrency such as railway network systems, production systems, traffic lights, etc. This research discusses the application of the linear Max-Plus equation in the train schedules and involves synchronization between trains. The result of this study are obtained DAOP VI Yogyakarta rail network system model in the form of x(k + 1) = A otimes x (k) which is then used to determine the departure period and the time of initial train departure. The departure period is obtained from the eigenvalue (lambda) from the A matrix and the initial departure is obtained from the eigenvector corresponding to lambda. The calculation shows that the train departure period is T = 588 minutes.

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Anis M’halla ◽  
Dimitri Lefebvre ◽  
Mouhaned Gaied

This paper falls under the problems of the monitoring of a Discrete Event System (DES) with time constraints. Among the various techniques used for online and distributed monitoring, we are interested in the chronicle recognition. Chronicles are temporal patterns that represent the system’s possible evolutions. The proposed models are based on P-time Petri nets that are suitable to represent with accuracy and modularity the Tunisian railway network. These models are scalable and may be used to represent a large variety of railway networks. Then, monitoring is based on the generation of chronicles that are suitable to detect and isolate traffic incidents in a distributed setting. Consequently, the proposed approach is tractable for large networks. Finally, to demonstrate the effectiveness and accuracy of the approach, an application to the case study of the Tunisian railway network is outlined.


Author(s):  
Bjørnar Luteberget ◽  
Koen Claessen ◽  
Christian Johansen ◽  
Martin Steffen

AbstractThis paper proposes a new method of combining SAT with discrete event simulation. This new integration proved useful for designing a solver for capacity analysis in early phase railway construction design. Railway capacity is complex to define and analyze, and existing tools and methods used in practice require comprehensive models of the railway network and its timetables. Design engineers working within the limited scope of construction projects report that only ad-hoc, experience-based methods of capacity analysis are available to them. Designs often have subtle capacity pitfalls which are discovered too late, only when network-wide timetables are made—there is a mismatch between the scope of construction projects and the scope of capacity analysis, as currently practiced. We suggest a language for capacity specifications suited for construction projects, expressing properties such as running time, train frequency, overtaking and crossing. Such specifications can be used as contracts in the interface between construction projects and network-wide capacity analysis. We show how these properties can be verified fully automatically by building a special-purpose solver which splits the problem into two: an abstracted SAT-based dispatch planning, and a continuous-domain dynamics with timing constraints evaluated using discrete event simulation. The two components communicate in a CEGAR loop (counterexample-guided abstraction refinement). This architecture is beneficial because it clearly distinguishes the combinatorial choices on the one hand from continuous calculations on the other, so that the simulation can be extended by relevant details as needed. We describe how loops in the infrastructure can be handled to eliminate repeating dispatch plans, and use case studies based on data from existing infrastructure and ongoing construction projects to show that our method is fast enough at relevant scales to provide agile verification in a design setting. Similar SAT modulo discrete event simulation combinations could also be useful elsewhere where one or both of these methods are already applicable such as in bioinformatics or hardware/software verification.


2020 ◽  
Vol 53 (4) ◽  
pp. 143-150
Author(s):  
Gabriel Freitas Oliveira ◽  
Renato Markele Ferreira Candido ◽  
Vinicius Mariano Gonçalves ◽  
Carlos Andrey Maia ◽  
Bertrand Cottenceau ◽  
...  

2020 ◽  
Vol 53 (4) ◽  
pp. 35-41
Author(s):  
Ze Yang Wang ◽  
Rômulo Meira-Góes ◽  
Stéphane Lafortune ◽  
Raymond H. Kwong

Sign in / Sign up

Export Citation Format

Share Document