Design of control laws for timed event graphs networks subject to mutual exclusion constraints in Min-Plus algebra

The right control of systems, especially when different constraints exist, can avoid many problems of cost and time loss. This paper relates to the resolution of the mutual exclusion problem for discrete event systems modeled with a Network of Timed Event Graphs (NTEGs). It aims to propose formal ap...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of control Vol. 63; pp. 270 - 276
Main Authors Soumatia, Maroua, Amari, Said
Format Journal Article
LanguageEnglish
Published Philadelphia Elsevier Ltd 01.01.2022
Elsevier Limited
Elsevier
Subjects
Algebra
Automatic
Control laws
Control theory
Controllers
Discrete event systems
Engineering Sciences
Graphs
Linear programming
Min-Plus algebra
Mutual exclusion constraints
Network of timed event graphs
System theory
Discrete event systems
Network of timed event graphs
Min-Plus algebra
Control laws
Mutual exclusion constraints
Online AccessGet full text

Cover

More Information
Summary:The right control of systems, especially when different constraints exist, can avoid many problems of cost and time loss. This paper relates to the resolution of the mutual exclusion problem for discrete event systems modeled with a Network of Timed Event Graphs (NTEGs). It aims to propose formal approaches based on Min-Plus algebra formalisms for the synthesis of control laws to guarantee mutual exclusion constraints in NTEGs. In these studies, the behavior of the network is described by a set of linear Min-Plus equations and mutual exclusion specifications are represented by inequalities that are also linear in Min-Plus algebra. Computed laws are modeled by control places which are connected to the initial NTEGs in order to prevent the violation of mutual exclusion constraints.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0947-3580
1435-5671
DOI:10.1016/j.ejcon.2021.11.007