Proceedings of the 44th IEEE Conference on Decision and Control
DOI: 10.1109/cdc.2005.1583412
|View full text |Cite
|
Sign up to set email alerts
|

Control of Linear Min-plus Systems under Temporal Constraints

Abstract: Abstract-We consider a class of controlled timed event graphs subject to strict temporal constraints. Such a graph is deterministic, in the sense that its behaviour only depends on the initial marking and on the control that is applied. This behaviour can be modelled by a system of difference equations that are linear in the Min-Plus algebra. The temporal constraint is represented by an inequality that is also linear in the min-plus algebra. Then, a method for the synthesis of a control law ensuring the respec… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 7 publications
0
8
0
Order By: Relevance
“…The presented approach in the Max-Plus algebra resembles to the one in the Min-Plus algebra already developed in [4]. We point out that the conditions obtained in Max-Plus algebra are simpler than that obtained in the Min-Plus case.…”
Section: Discussionmentioning
confidence: 90%
See 1 more Smart Citation
“…The presented approach in the Max-Plus algebra resembles to the one in the Min-Plus algebra already developed in [4]. We point out that the conditions obtained in Max-Plus algebra are simpler than that obtained in the Min-Plus case.…”
Section: Discussionmentioning
confidence: 90%
“…A first attempt to control TEG under strict temporal constraints has been presented in [4]. This initial approach was developed in the Min-Plus algebra, under the assumption that all delays of the considered graph are integers.…”
Section: Introductionmentioning
confidence: 99%
“…We denote by M max the maximal number of initial tokens (of initial marking) in one place. We recall from [2] a simplification based on the behavioral equivalence of P-time event graphs given by replacing every place containing m ≥ 2 tokens by place with 1 token and the same timing and upstream sequence of m − 1 transitions and places with timing [0, 0]. This leads to the event graphs, where the initial marking is bounded by 1.…”
Section: P-time Event Graphsmentioning
confidence: 99%
“…The supervision is aimed at guaranteeing the respect of temporal constraints without impacting significantly the dynamic behaviour of the system. Similar problems of 1 meeting time constraints have been recently addressed via different approaches [27,21,3,26,20]. We propose solutions based on a constrained (max, +) state equation for the TEG model of the DES.…”
Section: Introductionmentioning
confidence: 95%