tutorial

Description

...TUTORIALnotOF.LUSTRE.Nicolas.HALBWnoA.CHS,.P.ascal.RA.YMONDductionJanadded.uary.24,172002.Conrecursivten.ts191.Basicoflanguage.2alues1.1.SimpleThisconas-trolthedevicesmost.1.....no.....17.orks.....18.........prop.....20.......21.is2Lustre1.2ols.Numericalsystematicexamplescomplete.are.(arra.ed...........The.with...........Tw.net.............V.Program8.1.3.T.uples......4.2.safet.............Numerical...............y.cumen.in.the.and.ciated.e.e.tation.but.y.basic.12]..t.recursiv11are2[32Clo.c.ks.11.3.Arra.ys.and.recursiv.e.no3.5desdelay13de3.1recursionW.arning..................3.6.o.e.w.........................4.erication.4.1.comparison........13.3.2.A.binary.adder........19.Pro.of.y.erties.......................4.3.v..............13.3.3.The.exclusive.no.de....Bibliograph.23.do.t.an.tro.to.language.V4.its.so.to.W.will.giv.a.presen.of.language,.a.bibliograph.is.The.references.[8,16The3.4recenThefeaturesdelayys,noededes)withdescribarrainys]..A.2)toYandXtheFigureand1:1A ...

Informations

• Publié par: Maceb
• Nombre de lectures: 18
• Langue: Español

Extrait

.
A
.
TUTORIAL
.
OF
giv
LUSTRE
.
Nicolas
.
HALBW
.
A
des)
CHS,
.
P
.
ascal
.
RA
.
YMOND
.
Jan
to
uary
The
24,
.
2002
3.5
Con
.
ten
e
ts
.
1
4.1
Basic
.
language
of
2
.
1.1
.
Simple
.
con
do
trol
so
devices
language,
.
recen
.
.
.
.
.
.
.
de
.
.
.
.
.
3.6
.
.
.
.
.
.
.
4
.
.
.
.
.
.
.
19
.
erties
.
.
.
.
.
4.3
.
.
.
.
.
.
.
Bibliograph
2
an
1.2
V4
Numerical
W
examples
presen
.
bibliograph
.
[8,
.
ys,
.
in
.
.
.
.
.
.
.
.
.
.
.
delay
.
recursion
.
.
.
.
.
.
.
.
.
.
.
o
.
w
.
.
.
.
.
.
.
.
.
.
.
.
.
erication
8
comparison
1.3
.
T
.
uples
.
.
.
.
.
.
.
.
Pro
.
y
.
.
.
.
.
.
.
.
.
.
.
.
.
v
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
23
.
t
.
tro
.
language
.
its
.
to
.
will
.
a
.
of
.
a
.
is
.
references
.
The
.
features
11
e
2
describ
Clo
].
c
.
ks
.
11
.
3
.
Arra
.
ys
.
and
.
recursiv
.
e
.
no
17
des
The
13
no
3.1
with
W
.
arning
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
17
.
Tw
.
recursiv
.
net
.
orks
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
18
.
V
.
19
.
Program
.
.
.
.
.
.
.
.
13
.
3.2
.
A
.
binary
.
adder
.
.
.
.
.
.
.
.
.
.
4.2
.
of
.
safet
.
prop
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
20
.
Numerical
.
alues
.
.
.
.
.
.
.
.
.
.
.
.
13
.
3.3
.
The
.
exclusive
.
no
.
de
.
.
.
.
21
.
y
.
This
.
cumen
.
is
.
in
.
duction
.
the
.
Lustre
.
and
.
as-
.
ciated
.
ols.
.
e
.
not
.
e
.
systematic
.
tation
.
the
.
but
.
complete
.
y
.
added.
.
basic
.
are
16
12].
3.4
most
The
t
delay
(arra
no
recursiv
de
no
with
are
arra
ed
ys
[32
.
1
.;x
;:::
;x
;:::
;y
;:::
;y
;:::
be
;a
;:::
;a
;:::
;b
;:::
;b
;:::
;a
;:::
;a
;:::
be
r
(X:
is
B
a
three
functional
of
language
(its
op
a
erating
v
on
"
streams
a
.
X
F
op
or
2
the
2
momen
Here
t,
\
let
no
us
the
consider
not
that
to
a
v
stream
and
is
t-
a
)
nite
w
or
1
innite
)
sequence
and
of
erators
v
\
alues.
um
All
2
the
follo
v
bool);
alues
giv
of
Y
a
denes
stream
program
are
hand
of
".
the
input
same

t
are
yp
op
e,
if
whic
A
h
(
is
A
called
streams,
the
olean
t
1:
yp
^
e
op
of
w
the
data-
stream.
of
A
1
program
e
has
the
a
es
cyclic
"
b
v
eha
of
vior.
is
A
node
t
returns
the
denition
n
Y
th
b
execution
equation
cycle
X
of
This
the
Y
program,
side)
all
e
the
righ
in
expression
v
not
olv
expression
ed
es
streams
X
tak
erators
e
and
their
not
n
Bo
th
extended
v
p
alue.
on
A
=
no
Lustre
de
n
denes
B
one
1
or
No
sev
are
eral
Bo
output
A
parameters
the
as
(
functions
b
of
^
one
X
or
n
sev
Most
eral
are
input
in
parameters.
y
All
called
these
erators
parameters
the
are
data
streams.
Lustre
1.1
1
Simple
ha
con
vious
trol
"
devices
e
1.1.1
"
The
y
r
\
aising
\
e
explicit
dge
op
no
terface
de
the
As
de
a
the
v
wing:
ery
EDGE
rst
bool)
example,
(Y:
let
The
us
of
consider
output
a
is
Bo
en
olean
y
stream
single
X
:
=
=
(
and
x
pre(X);
1
equation
Lustre
\
2
"
.
left-hand
de
to
n
always
no
qual
)
the
.
t-
W
side
e
\
w
and
an
pre(X)
t
This
to
in
dene
olv
another
the
Bo
parameter
olean
and
stream
op
Y
:
=
\
(
"
y
\
1
"
a
usual
2
olean
called
erators,
is
to
n
erate
subprogram
oin
)
wise
corresp
streams:
ond-
A
ing
(
to
1
the
2
rising
language
edge
Basic
of
and
X
=
,
b
i.e.,
1
suc
de
h
n
that
)
y
t
n
o
+1
olean
is
then
true
and
if
is
and
Bo
only
stream
if
a
x
^
n
1
is
2
false
b
and
Figure
x
n
n
b
+1
Y
is
.
true
usual
(
erators
X
a
raised
ailable
from
that
false
a
to
,
true
are
at
\
cycle
op
n
".
+
is
1).
list
The
built-in
corresp
op
onding
in
no
-V4
de
:
(let
Most
us
them
call
v
or
ob
of
meanings.
olean
xor
and
is
true
exclusiv
cycle
\or",
if
#
only
tak
at
an
one
n
its
EDGE
is
it
Bo
EDGE
parameters,
)
returns
will
at
tak
n
e
and
X
if
as
most
an
of
input
parameters
parameter
true.
and
int
return
and
Y
real
as
are
an
con
output
ersion
parameter
erators.
The
in