Analytical methods for controlling timed event graphs with disturbances and paths subject to marking constraints: application to a disassembly process

This paper proposes analytical approaches to solve the problem of generalised marking constraints enforced on partially controllable and observable timed event graphs. For this purpose, the Min-Plus algebra formalisms is used to describe the behaviour of these graphs and to translate the specificati...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of control Vol. 98; no. 5; pp. 1059 - 1071
Main Authors Bouazza, S., Amari, S., Hassine, H.
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 04.05.2025
Taylor & Francis Ltd
Subjects
Constraints
control laws
Control methods
Controllability
Discrete event systems
Dismantling
generalised marking constraints
Graphs
Marking
Min-Plus algebra
partially observable and controllable transitions
timed event graphs
Online AccessGet full text

Cover

More Information
Summary:This paper proposes analytical approaches to solve the problem of generalised marking constraints enforced on partially controllable and observable timed event graphs. For this purpose, the Min-Plus algebra formalisms is used to describe the behaviour of these graphs and to translate the specifications to be satisfied. Sufficient conditions for the existence of causal control laws that ensure compliance with the constraints are established by manipulating Min-Plus equations and inequalities. An application of a disassembly system is carried out to demonstrate and validate the theoretical results.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7179
1366-5820
DOI:10.1080/00207179.2024.2380029