• Aucun résultat trouvé

Data processing tool for calculation in dioid

N/A
N/A
Protected

Academic year: 2022

Partager "Data processing tool for calculation in dioid"

Copied!
2
0
0

Texte intégral

(1)

CALCULATION IN DIOID

Cottenceau Bertrand, Lhommeau Mehdi, Hardouin Laurent, Boimond Jean-Louis

LISA62, Avenue Notre-Dame du Lac, 49000 ANGERS, FRANCE

[email protected]

Keywords: Dioid, Timed Event Graph, Periodic Series

Abstract This note presents briey a data processing tool to handle the periodic series.

Introduction

The team (max, +) of the INRIA Rocquencourt has developed a tool- box, integrated in software Scilab, for calculation in the dioids (max, +) or (min, +). We propose here to present a library of calculation for the periodic series in the dioid of formal series.

1. DATA PROCESSING TOOL

Let us recall that a timed event graph (TEG) is a timed Petri net whose each place has only one upstream transition and one downstream transition. The behavior of these graphs can be described by using one linear equations system into some particular dioids, for instance in the dioid of formal series such like the dioid MaxinJ;K (see [1]). The in- put/output behavior of TEG can then be described by a state represen- tation (X=AXBU,Y =CX) and/or a transfer matrixH =CAB withA =Li2NAi.

Each entries of this matrix is a periodic and causal series admit- ting a representation of the form: s = pqr with p = Li=0niti,

q =Lj=0NjTj and r = . The series is said proper if (n;t) (N0;T0) and if (N N0;T T0) ( ;): A series admits a simplest periodic proper representation, called the canonical form ofs.

1

(2)

As an example, below we provide a TEG, its representation of state and its transfer matrix in dioidMaxinJ;K .

8

>

>

>

>

<

>

>

>

>

: X =

0

@

" "

" "

2

2

e "

1

A

X 0

@ "

" e

" "

1

A

U

Y = " " eX

Y = 233() e23()U =HU:

u1u2 x1

x2 x3

1 2

1 y

Figure1 GET example

In this context, the manipulation of elementary systems and the syn- thesis of correctors require data-processing tools in order to handle the periodic series. S. Gaubert [4] proposes a certain number of algorithms making it possible to calculate the sum, the product and the star of these series. In [2] we propose algorithms computing the inf and the residuation of these same series. There are two implementations of these algorithms, one developed in script Matlab and the other devel- oped with language C++. We also propose a module making possible to interface this latest library with Scilab. This software was used to calculate, for instance, the applications of the references [3]. All these tools are available on http://www.istia.univ-angers.fr/hardouin.

References

[1] F. Baccelli, G. Cohen, G.J. Olsder, and J.P. Quadrat. Synchronization and Lin- earity: An Algebra for Discrete Event Systems. John Wiley and Sons, New York, 1992.

[2] B. Cottenceau. Contribution a la commande de systemes a evenements discrets : synthese de correcteurs pour les graphes d'evenements temporises dans les diodes. These de doctorat, Universite d'Angers, France, 1999.

[3] B. Cottenceau, L. Hardouin, J.L. Boimond, and J.L. Ferrier. Synthesis of great- est linear feedback for timed event graphs in dioid. IEEE Trans. on Automatic Control, 44(6):1258{1262, June 1999.

[4] S. Gaubert. Theorie des systemes lineaires dans les diodes. These de doctorat, Ecole des Mines de Paris, Paris, 1992.

Références

Documents relatifs

Bertrand Cottenceau, Mehdi Lhommeau, Laurent Hardouin, Jean-Louis Boimond.. To cite

Gaubert has shown in [9] that the number of tokens that must be placed in the feedback, in order to stabilize a TEG, is a resource optimization problem which can be formulated as

have shown, in [CP12], that there exists no algorithm computing a simple and equitable fair division for n ≥ 3 players in the Roberston-Webb model.. The strategy used in these

(ii) Secondly, when using analytical expressions of virial coef- ficients, the radius of convergence of the series has to be calculated in order to deduce the volume range on which

But the “isomorphism” hypothesis introduced by Gestalt psychology actually provides Koffka with a very easy and interesting answer to this objection: according to

In [8] linear closed-loop controllers synthesis are given in a model matching objective, i.e., a given reference model describes the desired performance lim- its, then the goal is

from a manufacturing point of view, this means to reduce the work-in-process by keeping the performance of this pro- duction system. In a second step, this principle will be applied

Abstract— This paper deals with robust open-loop control synthesis for timed event graphs, where the number of initial tokens and time delays are only known to belong to intervals..