By Topic

Control of Temporal Constraints Based on Dioid Algebra for Timed Event Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. Amari ; IRCCyN, CNRS, Nantes, France ; J. J. Loiseau ; I. Demongodin

We consider a class of controlled timed event graphs subject to strict temporal constraints. Such a graph is deterministic, in the sense that its behavior only depends on the initial marking and on the control that is applied. As it is wellknown, this behavior can be modelled by a system of difference equations that are linear in the Min-Plus algebra (R ∪ {+∞}, min, plus). The temporal constraint is represented by an inequation, that is also linear in the min-plus algebra. Then, a method for the synthesis of a control law ensuring the respect of the constraint is described. Two sufficient conditions are given, in terms of initial tokens and delays along the graph. We give explicit formulas characterizing a control law, which, if the conditions are satisfied, ensures the validity of the temporal constraints. This control law is also defined as a linear system over the Min-Plus algebra. It is a causal state feedback, involving delays. The method is illustrated on a production system.

Published in:

19th IEEE International Parallel and Distributed Processing Symposium

Date of Conference:

04-08 April 2005