DocumentCode
3128469
Title
Extremal trajectories in P-time Event Graphs: application to control synthesis with specifications
Author
Declerck, Philippe ; Khalid, Muhammad
Author_Institution
LISA FRE 2656, ISTIA, University of Angers, 62 avenue Notre-Dame du Lac, F-49000 Angers-FRANCE philippe.declerck@istia.univ-angers.fr
fYear
2005
fDate
12-15 Dec. 2005
Firstpage
7621
Lastpage
7626
Abstract
This paper presents a modelling and an analysis of P-time Event Graphs in the field of topical algebra. A particular serie of matrices is introduced whose evolution determines the system behavior and the existence of a trajectory without token deaths. The extremal trajectories obeying to an interval of desired output are deduced. If every event is controllable, the Just-In-Time control of Timed Event Graph is solved when additional specifications are given by a P-time Event Graph.
Keywords
(max,+) algebra; Kleene’star; P-time Petri Nets; Timed Event Graph; control synthesis; fixed point; token death; Acceleration; Algebra; Control system synthesis; Petri nets; Upper bound; (max,+) algebra; Kleene’star; P-time Petri Nets; Timed Event Graph; control synthesis; fixed point; token death;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on
Print_ISBN
0-7803-9567-0
Type
conf
DOI
10.1109/CDC.2005.1583392
Filename
1583392
Link To Document