2018
DOI: 10.1002/asjc.1787
|View full text |Cite
|
Sign up to set email alerts
|

State‐Feedback Control for a Class of Timed Petri Nets Subject to Marking Constraints

Abstract: The paper contributes with an original method of designing a control for discrete event systems modeled by a class of timed Petri nets. Precisely, this work deals with the closed loop control of Timed Event Graphs (TEGs) under specifications expressed with linear marking constraints. The objective of the controller is to limit the number of tokens in some places of these TEGs. The behavior of TEGs is represented by a system of difference equations that are linear in Min-Plus algebra and the constraints are des… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 23 publications
0
4
0
Order By: Relevance
“…Proof 1. Assuming a disturbed TEG where ρ is the path under marking constraint defined by inequality (6), the control laws are determined by:…”
Section: One Constraintmentioning
confidence: 99%
See 2 more Smart Citations
“…Proof 1. Assuming a disturbed TEG where ρ is the path under marking constraint defined by inequality (6), the control laws are determined by:…”
Section: One Constraintmentioning
confidence: 99%
“…Their purpose was to meet the temporal constraints imposed on system behavior. Others have examined requirements related to capabilities, which were expressed in Petri nets by marking constraints or forbidden states [4][5][6]. In our work, we are interested in the issue of limited resource capabilities in DESs modeled by timed event graphs (TEGs).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The present contribution extends the existing approaches for controlling TEGs subject to capacity constraints [20,22] by considering a more complex case of TEGs and integrating the phenomena of resource sharing and conflict, these systems are modeled by conflicting timed event graphs (CTEGs). Several works interested in this class use dioid algebra, like in [23], where authors gave their equivalent Max-Plus representation applied to a job shop example.…”
Section: Introductionmentioning
confidence: 99%