2.4 DIOID MODEL OF TIMED EVENT GRAPHS

Recall our example of a manufacturing system introduced in Section 2.1. The corresponding TEG modelling of this system is given in Figure 2.4, and the recursive equations for the earliest possible firing instants have been determined in (2.9) through (2.14). Rewriting these equations in max-plus algebra, that is, in the dioid $({\overline{\mathbb{Z}}}_{\mathrm{max}},\oplus ,\otimes )$ , we get the following:

$\begin{array}{l}{x}_{1}(k)={u}_{1}(k)\oplus {x}_{2}(k-2),\hfill \\ {x}_{2}(k)=10{x}_{1}(k),\hfill \\ {x}_{3}(k)={u}_{2}(k)\oplus {x}_{4}(k-1),\hfill \\ {x}_{4}(k)=4{x}_{3}(k),\hfill \\ {x}_{5}(k)={u}_{3}(k)\oplus 1{x}_{2}(k)\oplus 1{x}_{4}(k)\oplus {x}_{6}(k-1),\hfill \\ {x}_{6}(k)=3{x}_{5}(k),\hfill \end{array}$

and the output $y(k)\text{\hspace{0.17em}}\in \text{\hspace{0.17em}}{\overline{\mathbb{Z}}}_{\mathrm{max}}$ is

$y(k)={x}_{6}(k).$

This can be rewritten in matrix–vector form with * x*(

*k*) = [

*x*

_{1}(

*k*)

*x*

_{2}(

*k*)

*x*

_{3}(

*k*)

*x*

_{4}(

*k*)

*x*

_{5}(

*k*)

*x*

_{6}(

*k*)]

^{T}and

*(*

**u***k*) = [

*u*

_{1}(

*k*)

*u*

_{2}(

*k*)

*u*

_{3}(

*k*)]

^{T}:

$x\left(k\right)={A}_{0}x(k)\oplus {A}_{1}x(k-1)\oplus {A}_{2}x(k-2)\oplus Bu\text{(}k\text{),}$ |
(2.40) |

$y(k)=Cx(k)$ |

Get *Formal Methods in Manufacturing* now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.