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

This paper discusses the problem of marking constraints in a class of partially controllable timed Petri nets. Specifically, these are Timed Event Graphs (TEGs) which include disturbed input transitions and which are subject to token capacity constraints in some paths. Using the Min-Plus algebra for...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of control Vol. 97; no. 8; pp. 1874 - 1886
Main Authors Bouazza, S., Amari, S., Hassine, H., Barkallah, M., Haddar, M.
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 02.08.2024
Taylor & Francis Ltd
Subjects
Constraints
control laws
Control methods
Controllability
Discrete event systems
Dismantling
Graphs
Marking
marking constraints
Min-Plus algebra
Petri nets
timed event graphs with disturbances
Online AccessGet full text

Cover

More Information
Summary:This paper discusses the problem of marking constraints in a class of partially controllable timed Petri nets. Specifically, these are Timed Event Graphs (TEGs) which include disturbed input transitions and which are subject to token capacity constraints in some paths. Using the Min-Plus algebra formalism, formal approaches are proposed to design causal control laws to guarantee compliance with marking constraints in TEGs. Sufficient conditions are defined to show the existence and synthesis of these controllers. The developed methodologies are illustrated in a case study of a disassembly system with a limited stock of components.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7179
1366-5820
DOI:10.1080/00207179.2023.2236723