.rs
.\" Troff code generated by TPS Convert from ITU Original Files
.\"                 Not Copyright ( c) 1991 
.\"
.\" Assumes tbl, eqn, MS macros, and lots of luck.
.TA 1c 2c 3c 4c 5c 6c 7c 8c
.ds CH
.ds CF
.EQ
delim @@
.EN
.nr LL 40.5P
.nr ll 40.5P
.nr HM 3P
.nr FM 6P
.nr PO 4P
.nr PD 9p
.po 4P

.rs
\v | 5i'
.ce 1000
\v'12P'
\s12Annexes\ A,\ B,\ C\ and\ E
.EF '%	 \ \ \ ^''
.OF ''' \ \ \ ^	%'
.RT
.ce 0
.sp 1P
.ce 1000
to\ Recommendation\ Z.100
\v'2P'
.ce 0
.sp 1P
.ce 1000
\fBFUNCTIONAL\ SPECIFICATION\ AND\fR 
.ce 0
.sp 1P
.ce 1000
\fBDESCRIPTION\ LANGUAGE\ (SDL)\fR 
.ce 0
.sp 1P
.LP
.rs
.sp 29P
.LP
.bp
.LP
\fBMONTAGE:\fR PAGE 206 = PAGE BLANCHE
.sp 1P
.RT
.LP
.bp
.ce 1000
ANNEX\ A
.ce 0
.ce 1000
(to Recommendation Z.100)
.EF '%	Fascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ A''
.OF '''Fascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ A	%'
.sp 9p
.RT
.ce 0
.ce 1000
\fBSDL Glossary\fR 
.sp 1P
.RT
.ce 0
.PP
The Z.100 Recommendation contains the formal definitions of
SDL terminology. The SDL Glossary is compiled to help new SDL users when
reading the Recommendation and its annexes, giving a brief definition and
reference to the defining section of the Recommendation. The definitions 
in the Glossary may summarize or paraphrase the formal definitions, and 
thus may be 
incomplete.
.sp 1P
.RT
.PP
Terms which are in a definition may also be found in the glossary. If an 
italicized phrase, for example \fIprocedure identifier\fR , is not in the 
glossary, then it may be the concatenation of two terms, in this case the 
term \fIprocedure\fR followed by the term \fIidentifier\fR . When a word 
is in italics but 
cannot be located in the glossary, it may be a derivative of a glossary 
term. For example, \fIexported\fR is the past tense of \fIexport\fR . 
.PP
Except where a term is a synonym for another term, after the
definition of the term there is a main reference to the use of the term 
in the Z.100\ Recommendation. These references are shown in square brackets\ 
[\ \ ] after definitions. For example, [3.2] indicates that the main reference 
is in 
\(sc\ 3.2.
.RT
.sp 2P
.LP
	\fBabstract data type\fR 
.sp 1P
.RT
.LP
	\fIF | \fR \ \fItype abstrait de donn\*'ees\fR 
.LP
	\fIS | \fR \ \fItipo abstracto de datos\fR 
.PP
\fIAbstract data type\fR is a synonym for \fIdata type\fR . All \fISDL 
data\fR \fItypes\fR are \fIabstract data types\fR . 
.RT
.sp 1P
.LP
	\fBabstract grammar\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIgrammaire abstraite\fR 
.LP
	\fIS | \fR \ \fIgram\*'atica abstracta\fR 
.PP
The \fIabstract grammar defines the semantics\fR of \fISDL\fR . The
\fIabstract grammer\fR is described by the \fIabstract syntax\fR and the
\fIwell\(hyformedness rules\fR . [1.2, 1.4.1]
.RT
.sp 1P
.LP
	\fBabstract syntax\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsyntaxe abstraite\fR 
.LP
	\fIS | \fR \ \fIsintaxis abstracta\fR 
.PP
The \fIabstract syntax\fR is the means to describe the conceptual
structure of an \fISDL specification\fR as compared with the \fIconcrete 
syntaxes\fR which exist for each \fIconcrete syntax\fR of \fISDL\fR , this 
is \fISDL/GR\fR and 
\fISDL/PR\fR . [1.2]
.RT
.sp 1P
.LP
	\fBaccess\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIacc\*`es\fR 
.LP
	\fIS | \fR \ \fIacceder\fR 
.PP
\fIAccess\fR is the operation applied to a \fIvariable\fR which gives the 
\fIvalue\fR which was last assigned to it. If a \fIvariable\fR is \fIaccessed\fR 
which has an \fIundefined value\fR , then an \fIerror\fR occurs. 
.RT
.sp 1P
.LP
	\fBaction\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIaction\fR 
.LP
	\fIS | \fR \ \fIacci\*'on\fR 
.PP
An \fIaction\fR is an operation which is executed within a
\fItransition string\fR , e.g.,\ a \fItask, output, decision, create request\fR 
or\fR 
\fIprocedure call\fR . [2.7]
.RT
.sp 1P
.LP
	\fBactive timer\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fItemporisateur actif\fR 
.LP
	\fIS | \fR \ \fItemporizador activo\fR 
.PP
An \fIactive timer\fR is a \fItimer\fR which has a \fItimer signal\fR in 
the \fIinput port\fR of the owning \fIprocedure\fR or is scheduled to produce 
a \fItimer\fR 
\fIsignal\fR at some future time. [2.8.2, 5.5.4.5]
.bp
.RT
.sp 1P
.LP
	\fBactual parameter\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIparam\*`etre r\*'eel\fR 
.LP
	\fIS | \fR \ \fIpar\*`ametro efectivo\fR 
.PP
An \fIactual parameter\fR is an \fIexpression\fR given to a \fIprocess\fR 
or \fIprocedure\fR for the corresponding \fIformal parameter\fR when the 
\fIprocess\fR or 
\fIprocedure\fR is \fIcreated\fR (or \fIcalled\fR ). Note that in certain 
cases in a 
procedure call an \fIactual parameter\fR must be a \fIvariable\fR (i.e.\ 
a particular 
type of \fIexpression\fR ; see \fIIN/OUT\fR ). [2.7.2, 2.7.3,
4.2.2]
.RT
.sp 1P
.LP
	\fBactual parameter list\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIliste de param\*`etres r\*'eels\fR 
.LP
	\fIS | \fR \ \fIlista de par\*`ametros efectivos\fR 
.PP
An \fIactual parameter list\fR is the list of \fIactual parameters\fR . 
The \fIactual parameters\fR are matched by position with the respective 
elements of the corresponding \fIformal parameter list\fR . 
.RT
.sp 1P
.LP
	\fBarea\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone\fR 
.LP
	\fIS | \fR \ \fI\*'area; zona\fR 
.PP
An \fIarea\fR is a two dimensional region in the \fIconcrete graphical\fR 
\fIsyntax\fR . \fIArea\fR often correspond to \fInodes\fR in the \fIabstract 
syntax\fR and 
usually contain \fIcommon textual syntax\fR . In \fIinteraction diagrams\fR 
areas may be connected by \fIchannels\fR or \fIsignal routes\fR . In \fIcontrol 
flow diagrams areas\fR may be connected by \fIflow lines\fR . 
.RT
.sp 1P
.LP
	\fBarray\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fItableau (array)\fR 
.LP
	\fIS | \fR \ \fImatriz\fR 
.PP
\fIArray\fR is the predefined \fIgenerator\fR used to introduce the
concept of arrays, easing the definition of arrays.
.RT
.sp 1P
.LP
	\fBassign\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIaffectation\fR 
.LP
	\fIS | \fR \ \fIasignar\fR 
.PP
\fIAssign\fR is the operation applied to a \fIvariable\fR which associates 
a \fIvalue\fR to the \fIvariable\fR replacing the previous \fIvalue\fR 
associated with the \fIvariable\fR . [5.5.3] 
.RT
.sp 1P
.LP
	\fBassignment statement\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIinstruction d'affectation\fR 
.LP
	\fIS | \fR \ \fIsentencia de asignaci\*'on\fR 
.PP
An \fIassignment statement\fR is a \fIstatement\fR which assigns a \fIvalue\fR 
to a \fIvariable\fR . [5.5.3] 
.RT
.sp 1P
.LP
	\fBassociation area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone d'association\fR 
.LP
	\fIS | \fR \ \fI\*'area de asociaci\*'on\fR 
.PP
An \fIassociation area\fR is a connection between \fIareas\fR in an
\fIinteraction diagram\fR by means of an association \fIsymbol\fR . There 
are five 
asociation areas: \fIchannel substraction association area, input association\fR 
\fIarea\fR , priority \fIinput association area, continuous signal association 
area\fR and \fIsave association area\fR . [2.6.3, 3.2.3, 4.10.2, 
4.11]
.RT
.sp 1P
.LP
	\fBaxiom\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIaxiome\fR 
.LP
	\fIS | \fR \ \fIaxioma\fR 
.PP
An \fIaxiom\fR is a special kind of \fIequation\fR with an implied
equivalence to the \fIBoolean literal\fR True. \*Q\fIAxioms\fR \*U is used 
as a synonym for \*Q\fIaxioms\fR and \fIequations\fR .\*U [5.1.3] 
.bp
.RT
.sp 1P
.LP
	\fBbasic SDL\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fILDS de base\fR 
.LP
	\fIS | \fR \ \fILED b\*'asico\fR 
.PP
\fIBasic SDL\fR is the subset of \fISDL\fR defined in \(sc 2 of
Recommendation\ Z.100.
.RT
.sp 1P
.LP
	\fBbehaviour\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIcomportement\fR 
.LP
	\fIS | \fR \ \fIcomportamiento\fR 
.PP
The \fIbehaviour\fR or \fIfunctional behaviour\fR of a \fIsystem\fR is 
the set of sequences of responses to sequences of stimuli. [1.1.3] 
.RT
.sp 1P
.LP
	\fBblock\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIbloc\fR 
.LP
	\fIS | \fR \ \fIbloque\fR 
.PP
A \fIblock\fR is part of a \fIsystem\fR or parent \fIblock\fR . When used by
itself, \fIblock\fR is a synonym for a \fIblock instance\fR . A \fIblock\fR 
is a \fIscope\fR 
\fIunit\fR and provides a static interface. [2.4.3]
.RT
.LP
\fR 
.sp 1P
.LP
	\fBblock area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de bloc\fR 
.LP
	\fIS | \fR \ \fI\*'area de bloque\fR 
.PP
The \fIblock area\fR is the definition of a \fIblock\fR or a reference 
to a \fIblock\fR in an \fIinteraction diagram\fR . [2.4.2] 
.RT
.sp 1P
.LP
\fR 	\fBblock definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de bloc\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de bloque\fR 
.PP
A \fIblock definition\fR is the definition of a \fIblock\fR in \fISDL/PR\fR 
. [2.4.2] 
.RT
.sp 1P
.LP
\fR 	\fBblock diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme de bloc\fR 
.LP
	\fIS | \fR \ \fIdiagrama de bloque\fR 
.PP
The \fIblock diagram\fR is the definition of a \fIblock\fR in \fISDL/GR\fR 
. [2.4.3] 
.RT
.sp 1P
.LP
\fR 	\fBblock substructure\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsous\(hystructure de bloc\fR 
.LP
	\fIS | \fR \ \fIsubestructura de bloque\fR 
.PP
A \fIblock substructure\fR is the \fIpartitioning\fR of the \fIblock\fR 
into \fIsubblocks\fR and new \fIchannels\fR at a lower \fIlevel of abstraction\fR 
. 
[3.2.2]
.RT
.LP
\fR 
.sp 1P
.LP
	\fBblock substructure definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de sous\(hystructure de bloc\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de subestructura de bloque\fR 
.PP
A \fIblock substructure definition\fR is the \fISDL/PR\fR representation 
of a \fIblock substructure\fR for a partitioned block. [3.2.2] 
.bp
.RT
.sp 1P
.LP
\fR 
	\fBblock substructure diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme de sous\(hystructure de bloc\fR 
.LP
	\fIS | \fR \ \fIdiagrama de subestructura de bloque\fR 
.PP
A \fIblock substructure diagram\fR is the \fISLD/GR\fR representation of 
a \fIblock substructure\fR for a \fIpartitioned block\fR . [3.2.2] 
.RT
.sp 1P
.LP
\fR 
	\fBblock tree diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme d'arborescence de bloc\fR 
.LP
	\fIS | \fR \ \fIdiagrama de \*'arbol de bloques\fR 
.PP
A \fIblock tree diagram\fR is an auxiliary document in \fISDL/GR\fR 
representing the \fIpartitioning\fR of a \fIsystem\fR into \fIblocks\fR 
at lower 
\fIlevels of abstraction\fR by means of an inverted tree diagram (\fIi.e.\fR 
, parent 
\fIblock\fR at the top). [3.22]
.RT
.LP
\fR 
.sp 1P
.LP
	\fBBNF (Backus\(hyNaur Form)\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIforme BNF (Backus\(hyNaur Form)\fR 
.LP
	\fIS | \fR \ \fIFBN (forma Backus\(hyNaur)\fR 
.PP
\fIBNF\fR (Backus\(hyNaur Form) is a formal notation used for expressing 
the \fIconcrete textual syntax\fR of a language. An extended form of \fIBNF\fR 
is used for expressing the \fIconcrete graphical grammar\fR . [1.5.2, 1.5.3] 
.RT
.sp 1P
.LP
\fR 
	\fBBoolean\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIbool\*'een\fR 
.LP
	\fIS | \fR \ \fIbooleano\fR 
.PP
\fIBoolean\fR is a \fIsort\fR defined in a predefined \fIpartial type\fR 
\fIdefinition\fR and has the \fIvalues\fR True and False. For the \fIsort 
Boolean\fR 
the predefined \fIoperators\fR are NOT, AND, OR, XOR and implication. [5.6.1]
.RT
.sp 1P
.LP
	\fBchannel\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIcanal\fR 
.LP
	\fIS | \fR \ \fIcanal\fR 
.PP
A \fIchannel\fR is the connection conveying \fIsignals\fR between two
\fIblocks\fR . \fIChannels\fR also convey \fIsignals\fR between a \fIblock\fR 
and the 
\fIenvironment\fR . \fIChannels\fR may be unidirectional or bidirectional.
[2.5.1]
.RT
.sp 1P
.LP
	\fBchannel definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de canal\fR 
.PP
A \fIchannel definition\fR is the definition of a \fIchannel\fR in
\fISDL/PR\fR . [2.5.1]
.RT
.sp 1P
.LP
	\fBchannel definition area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de d\*'efinition de canal\fR 
.LP
	\fIS | \fR \ \fI\*'area de definici\*'on de canal\fR 
.PP
The \fIchannel definition area\fR is the definition of a
\fIchannel\fR in \fISDL/GR\fR . [2.5.1]
.RT
.sp 1P
.LP
	\fBchannel substructure\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsous\(hystructure de canal\fR 
.LP
	\fIS | \fR \ \fIsubestructura de canal\fR 
.PP
A \fIchannel substructure\fR is a \fIpartitioning\fR of a \fIchannel\fR 
into a set of \fIchannels\fR and \fIblocks\fR at a \fIlower level of abstraction\fR 
. 
[3.2.3]
.bp
.RT
.sp 1P
.LP
	\fBchannel substructure definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de sous\(hystructure de canal\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de subestructura de canal\fR 
.PP
A \fIchannel substructure definition\fR is the definition of the
\fIchannel substructure\fR in \fISDL/PR\fR . [3.2.3]
.RT
.sp 1P
.LP
\fR 	\fBchannel substructure diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme de sous\(hystructure de canal\fR 
.LP
	\fIS | \fR \ \fIdiagrama de subestructura de canal\fR 
.PP
A \fIchannel substructure diagram\fR is the definition of the channel substructure 
in \fISDL/GR\fR . [3.2.3] 
.RT
.sp 1P
.LP
\fR 	\fBcharacter\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIcaract\*`ere (character)\fR 
.LP
	\fIS | \fR \ \fIcar\*'acter; character\fR 
.PP
\fICharacter\fR is a \fIsort\fR defined in a predefined \fIpartial type\fR 
\fIdefinition\fR for which the \fIvalues\fR are the elements of the CCITT\ 
No.\ 5 
alphabet, (e.g.,\ 1, A, B, C,\ etc.). For the \fIsort character\fR the 
\fIordering\fR 
\fIoperators\fR are predefined. [5.6.2]
.RT
.LP
\fR 
.sp 1P
.LP
	\fBchartstring\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIcha\* | ne de caract\*`eres (character string)\fR 
.LP
	\fIS | \fR \ \fIcadena\(hyde\(hycaracteres; chartstring\fR 
.PP
\fIChartstring\fR is a \fIsort\fR defined in a predefined \fIpartial type\fR 
\fIdefinition\fR for which the \fIvalues\fR are \fIstrings\fR of \fIcharacters\fR 
and the\fR 
\fIoperators\fR are those of the \fIstring\fR predefined \fIgenerator\fR 
instantiated for \fIcharacters\fR . [5.6.4] 
.RT
.sp 1P
.LP
\fR 	\fBcomment\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIcommentaire\fR 
.LP
	\fIS | \fR \ \fIcomentario\fR 
.PP
A \fIcomment\fR is information which is in addition to or clarifies
the \fISDL specification\fR . In \fISDL/GR comments\fR may be attached 
by a dashed line to any \fIsymbol\fR . In \fISDL/PR comments\fR are introduced 
by the keyword \fICOMMENT\fR . \fIComments\fR have no \fISDL\fR defined 
meaning. See also \fINote\fR . 
[2.2.6]
.RT
.sp 1P
.LP
\fR 	\fBcommon textual grammar\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIgrammaire textuelle commune\fR 
.LP
	\fIS | \fR \ \fIgram\*'atica textual com\*'un\fR 
.PP
The \fIcommon textual grammar\fR is the subset of the \fIconcrete\fR 
\fItextual grammar\fR which applies to both \fISDL/GR\fR and \fISDL/PR\fR .
[1.2]
.RT
.LP
\fR 
.sp 1P
.LP
	\fBcommunication path\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fItrajet de communication\fR 
.LP
	\fIS | \fR \ \fItrayecto de comunicaci\*'on\fR 
.PP
A \fIcommunication path\fR is a transportation means that carriers
\fIsignal instances\fR from one \fIprocess instance\fR or from the \fIenvironment\fR 
to 
another \fIprocess instance\fR or to the \fIenvironment\fR . A \fIcommunication 
path\fR 
comprises either \fIchannel\fR path(s) or \fIsignal route\fR path(s) or 
a combination of both. [2.7.4] 
.RT
.sp 1P
.LP
\fR 	\fBcomplete valid input signal set\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIensemble complet de signaux d'entr\*'ee valides\fR 
.LP
	\fIS | \fR \ \fIconjunto completo de se\o"n~"ales de entrada v\*'alidas\fR 
.PP
The \fIcomplete valid input signal set\fR of a \fIprocess\fR is the union 
of the \fIvalid input signal\fR set, the local \fIsignals, timer signals\fR 
and the 
\fIimplicit signals\fR of the \fIprocess\fR . [2.4.4]
.bp
.RT
.sp 1P
.LP
\fR 
	\fBconcrete grammar\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIgrammaire concr\*`ete\fR 
.LP
	\fIS | \fR \ \fIgram\*'atica concreta\fR 
.PP
A \fIconcrete grammar\fR is the \fIconcrete syntax\fR along with the
\fIwell\(hyformedness rules\fR for that \fIconcrete syntax\fR . \fISDL/GR\fR 
and \fISDL/PR\fR are the \fIconcrete grammars\fR of \fISDL\fR . The \fIconcrete 
grammars\fR are mapped to the 
\fIabstract grammar\fR to determine their \fIsemantics\fR . [1.2]
.RT
.LP
\fR 
.sp 1P
.LP
	\fBconcrete graphical grammar\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIgrammaire graphic concr\*'ete\fR 
.LP
	\fIS | \fR \ \fIgram\*'atica gr\*'afica concreta\fR 
.PP
The \fIconcrete graphical grammar\fR is the \fIconcrete grammar\fR for
the graphical part of SDL/GR.
.RT
.sp 1P
.LP
	\fBconcrete graphical syntax\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsyntaxe graphique concr\*`ete\fR 
.LP
	\fIS | \fR \ \fIsintaxis gr\*'afica concreta\fR 
.PP
The \fIconcrete graphical syntax\fR is the \fIconcrete syntax\fR for the 
graphical part of \fISDL/GR\fR . The \fIconcrete graphical syntax\fR is 
expressed in 
Z.100 using an extended form of \fIBNF\fR . [1.2, 1.5.3]
.RT
.sp 1P
.LP
\fR 	\fBconcrete syntax\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsyntaxe concr\*`ete\fR 
.LP
	\fIS | \fR \ \fIsintaxis concreta\fR 
.PP
The \fIconcrete syntax\fR for the various representations of \fISDL\fR 
is the actual \fIsymbols\fR used to represent \fISDL\fR and the interrelationship 
between \fIsymbols\fR required by the syntactic rules of \fISDL\fR . The 
two \fIconcrete syntaxes\fR used in Z.100 are the \fIconcrete graphical 
syntax\fR and the \fIconcrete textual\fR \fIsyntax\fR . [1.2] 
.RT
.LP
\fR 
.sp 1P
.LP
	\fBconcrete textual syntax\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsyntaxe textuelle concr\*`ete\fR 
.LP
	\fIS | \fR \ \fIsintaxis textual concreta\fR 
.PP
The \fIconcrete textual syntax\fR is the \fIconcrete syntax\fR for
\fISDL/PR\fR and the textual parts of \fISDL/GR\fR . The \fIconcrete textual 
syntax\fR is 
expressed in Z.100 using \fIBNF\fR . [1.2, 1.5.2]
.RT
.sp 1P
.LP
\fR 	\fBconditional expression\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIexpression conditionnelle\fR 
.LP
	\fIS | \fR \ \fIexpresi\*'on condicional\fR 
.PP
A \fIconditional expression\fR is an \fIexpression\fR containing a
\fIBoolean expression\fR which controls whether the consequence \fIexpression\fR 
or the alternative \fIexpression\fR is interpreted. [5.5.2.3] 
.RT
.sp 1P
.LP
\fR 	\fBconnect\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIconnect\fR 
.LP
	\fIS | \fR \ \fIconectar\fR 
.PP
\fIConnect\fR indicates the connection of a \fIchannel\fR to one or more 
\fIsignal routes\fR . [2.5.3] 
.RT
.LP
\fR 
.sp 1P
.LP
	\fBconnector\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIconnecteur\fR 
.LP
	\fIS | \fR \ \fIconector\fR 
.PP
A \fIconnector\fR is an \fISDL/GR symbol\fR which is either an
\fIin\(hyconnector\fR or an \fIout\(hyconnector\fR . A \fIflow line\fR 
is implied from 
\fIout\(hyconnectors\fR to the associated \fIin\(hyconnector\fR in the 
same \fIprocess\fR or 
\fIprocedure\fR identified by having the same \fIname\fR . [2.6.6]
.bp
.RT
.sp 1P
.LP
\fR 	\fBconsistent partitioning subset\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsous\(hyensemble de subdivision coh\*'erent\fR 
.LP
	\fIS | \fR \ \fIsubconjunto de partici\*'on consistente\fR 
.PP
A \fIconsistent partitioning subset\fR is a set of the \fIblocks\fR and
\fIsubblocks\fR in a \fIsystem specification\fR which provides a complete 
view of the \fIsystem\fR with related parts at a corresponding \fIlevel 
of abstraction\fR . Thus, 
when a \fIblock\fR or \fIsubblock\fR is contained in a \fIconsistent partitioning\fR 
\fIsubset\fR , its ancestors and siblings are too. [3.2.1]
.RT
.sp 1P
.LP
	\fBconsistent refinement subset\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsous\(hyensemble de raffinement coh\*'erent\fR 
.LP
	\fIS | \fR \ \fIsubconjunto de refinamiento consistente\fR 
.PP
The \fIconsistent refinement subset\fR is a \fIconsistent partitioning\fR 
\fIsubset\fR which contains all \fIblocks\fR and \fIsubblocks\fR which 
use the \fIsignals\fR used by any of the \fIblocks\fR or \fIsubblocks\fR 
. [3.3] 
.RT
.sp 1P
.LP
\fR 	\fBcontinuous signal\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsignal continu\fR 
.LP
	\fIS | \fR \ \fIse\o"n~"al continua\fR 
.PP
A \fIcontinuous signal\fR is a means to define that when in a \fIstate\fR 
the associated \fIBoolean\fR condition becomes True, the \fItransition\fR 
following the \fIcontinuous signal\fR is interpreted. [4.11] 
.RT
.sp 1P
.LP
\fR 	\fBcontrol flow diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme de liaison de contr\* | le\fR 
.LP
	\fIS | \fR \ \fIdiagrama de flujo de control\fR 
.PP
A \fIcontrol flow diagram\fR is either a \fIprocess diagram\fR , a
\fIprocedure diagram\fR , or a \fIservice diagram\fR .
.RT
.sp 1P
.LP
	\fBcreate\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIcr\*'eer\fR 
.LP
	\fIS | \fR \ \fIcrear\fR 
.PP
\fICreate\fR is a synonym for \fIcreate request\fR .
.RT
.sp 1P
.LP
	\fBcreate request\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdemande de cr\*'eation\fR 
.LP
	\fIS | \fR \ \fIpetici\*'on de crear\fR 
.PP
A \fIcreate request\fR is the \fIaction\fR causing the creation and
starting of a new \fIprocess instance\fR using a specified \fIprocess type\fR 
as a 
template. The \fIactual parameters\fR in the \fIcreate request\fR replace 
the \fIformal\fR \fIparameters\fR in the \fIprocess\fR [2.7.2] 
.RT
.sp 1P
.LP
\fR 	\fBcreate line area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de ligne de cr\*'eation\fR 
.LP
	\fIS | \fR \ \fI\*'area de l\*'inea de crear\fR 
.PP
The \fIcreate line area\fR in a \fIblock diagram\fR connects the \fIprocess\fR 
\fIarea\fR of the \fIcreating (PARENT) process\fR with the \fIprocess area\fR 
of the 
\fIcreated (OFFSPRING) process\fR [2.4.3]
.RT
.LP
\fR 
.sp 1P
.LP
	\fBdata type\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fItype de donn\*'ees\fR 
.LP
	\fIS | \fR \ \fItipo de datos\fR 
.PP
A \fIdata type\fR is the definition of sets of \fIvalues (sorts)\fR , a 
set of \fIoperators\fR which are applied to these \fIvalues\fR and a set 
of algebraic rules (\fIequations\fR ) defining the \fIbehaviour\fR when 
the \fIoperators\fR are applied to the \fIvalues\fR . [2.3.1] 
.bp
.RT
.sp 1P
.LP
\fR 	\fBdata type definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de type de donn\*'ees\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de tipo de datos\fR 
.PP
A \fIdata type definition\fR defines the validity of \fIexpressions\fR 
and relationship between \fIexpressions\fR at any given point in an \fISDL\fR 
\fIspecification\fR . [5.2.1]
.RT
.sp 1P
.LP
	\fBdecision\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'ecicion\fR 
.LP
	\fIS | \fR \ \fIdecisi\*'on\fR 
.PP
A \fIdecision\fR is an \fIaction\fR within a \fItransition\fR which asks a
question to which the answer can be obtained at that instant and accordingly
chooses one of the several outgoing \fItransitions\fR from the \fIdecision\fR 
to 
continue interpretation. [2.7.5]
.RT
.sp 1P
.LP
	\fBdecision area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de d\*'ecision\fR 
.LP
	\fIS | \fR \ \fI\*'area de decisi\*'on\fR 
.PP
A \fIdecision area\fR is the \fISDL/GR\fR representation of a \fIdecision\fR 
. [2.7.5] 
.RT
.sp 1P
.LP
	\fBdefault\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efault\fR 
.LP
	\fIS | \fR \ \fIpor defecto\fR 
.PP
The \fIdefault assignment\fR is a denotation of a \fIvalue\fR that is
initially associated to each \fIvariable\fR of the \fIsort\fR of the \fIdefault\fR 
clause. The \fIdefault\fR clause may appear in \fIdata type definitions\fR 
. 
[5.5.3.3]
.RT
.sp 1P
.LP
\fR 	\fBdescription\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdescription\fR 
.LP
	\fIS | \fR \ \fIdescripci\*'on\fR 
.PP
A \fIdescription\fR of a \fIsystem\fR is the description of its actual
\fIbehaviour\fR . [1.1]
.RT
.sp 1P
.LP
	\fBdiagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme\fR 
.LP
	\fIS | \fR \ \fIdiagrama\fR 
.PP
A \fIdiagram\fR is the \fISDL/GR\fR representation for a part of a
\fIspecification\fR . [2.4.2]
.RT
.sp 1P
.LP
	\fBduration\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdur\*'ee (duration)\fR 
.LP
	\fIS | \fR \ \fIduraci\*'on; duration\fR 
.PP
\fIDuration\fR is a \fIsort\fR defined in a predefined \fIpartial type\fR 
\fIdefinition\fR for which the \fIvalues\fR are denoted as \fIreals\fR 
and represent the 
interval between two time instants. [5.6.11]
.RT
.sp 1P
.LP
	\fBenabling condition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIcondition de validation\fR 
.LP
	\fIS | \fR \ \fIcondici\*'on habilitante (o habilitadora)\fR 
.PP
An \fIenabling condition\fR is a means for conditionally accepting a \fIsignal\fR 
for \fIinput\fR . [4.12] 
.bp
.RT
.LP
\fR 
.sp 1P
.LP
	\fBenabling condition area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de condition de validation\fR 
.LP
	\fIS | \fR \ \fI\*'area de condici\*'on habilitante (o habilitadora)\fR 
.PP
The \fIenabling condition area\fR is the \fISDL/GR\fR representation of 
an \fIenabling condition\fR . [4.12] 
.RT
.sp 1P
.LP
	\fBentity class\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIclasse d'entit\*'e\fR 
.LP
	\fIS | \fR \ \fIclase de entidad\fR 
.PP
An \fIentity class\fR is a categorization of \fISDL types\fR based on
similarity of use. [2.2.2]
.RT
.sp 1P
.LP
\fR 	\fBenvironment\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIenvironnement\fR 
.LP
	\fIS | \fR \ \fIentorno\fR 
.PP
The term \fIenvironment\fR is a synonym for the \fIenvironment of a\fR 
\fIsystem\fR . Also when context allows, it may be a synonym for the \fIenvironment\fR 
of a \fIblock, process, procedure\fR or a \fIservice\fR . [1.3.2] 
.RT
.sp 1P
.LP
	\fBenvironment of a system\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIenvironnement d'un syst\*`eme\fR 
.LP
	\fIS | \fR \ \fIentorno de un sistema\fR 
.PP
The \fIenvironment of a system\fR is the external world of the
\fIsystem\fR being specified. The environment interacts with the \fIsystem\fR 
by 
sending/receiving \fIsignal instances\fR to/from the \fIsystem\fR . [1.3.2]
.RT
.sp 1P
.LP
	\fBequation\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fI\*'equation\fR 
.LP
	\fIS | \fR \ \fIecuaci\*'on\fR 
.PP
An \fIequation\fR is a relation between \fIterms\fR of the same \fIsort\fR 
which holds for all possible \fIvalues\fR substituted for each \fIvalue 
identifier\fR in the \fIequation\fR . An \fIequation\fR may be an \fIaxiom\fR 
. [5.1.3, 5.2.3] 
.RT
.sp 1P
.LP
	\fBerror\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIerreur\fR 
.LP
	\fIS | \fR \ \fIerror\fR 
.PP
An \fIerror\fR occurs during the interpretation of a \fIvalid\fR 
\fIspecification\fR of a \fIsystem\fR when one of the dynamic conditions 
\fISDL\fR is 
violated. Once an \fIerror\fR has occurred, the subsequent \fIbehaviour\fR 
of the 
\fIsystem\fR is not defined by \fISDL\fR . [1.3.3]
.RT
.sp 1P
.LP
	\fBexport\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIexport\fR 
.LP
	\fIS | \fR \ \fIexportaci\*'on\fR 
.PP
The term \fIexport\fR is a synonym for \fIexport operation\fR .
.RT
.sp 1P
.LP
	\fBexported variable\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIvariable export\*'ee\fR 
.LP
	\fIS | \fR \ \fIvariable exportada\fR 
.PP
An \fIexported variable\fR is a \fIvariable\fR which can be used in an
\fIexport operation\fR . [4.13]
.RT
.sp 1P
.LP
	\fBexporter\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIexportateur\fR 
.LP
	\fIS | \fR \ \fIexportador\fR 
.PP
An \fIexporter\fR of a \fIvariable\fR in the \fIprocess instance\fR which 
owns the \fIvariable\fR and \fIexports\fR its \fIvalues\fR . [4.13] 
.bp
.RT
.sp 1P
.LP
\fR 
	\fBexport operation\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIop\*'eration d'exportation\fR 
.LP
	\fIS | \fR \ \fIoperaci\*'on de exportaci\*'on\fR 
.PP
An \fIexport operation\fR is the operation by which the \fIexporter\fR 
discloses the \fIvalue\fR of a \fIvariable\fR . See \fIimport operation\fR 
. [4.13] 
.RT
.sp 1P
.LP
	\fBexpression\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIexpression\fR 
.LP
	\fIS | \fR \ \fIexpresi\*'on\fR 
.PP
An \fIexpression\fR is either a \fIliteral\fR , an \fIoperator\fR application, 
a \fIsynonym\fR , a \fIvariable access\fR , a \fIconditional expression\fR 
, or an 
\fIimperartive operator\fR applied to one or more \fIexpressions\fR . When an
\fIexpression\fR is interpreted a \fIvalue\fR is obtained (or the \fIsystem\fR 
is in 
\fIerror\fR ). [2.3.4, 5.4.2.1]
.RT
.sp 1P
.LP
	\fBexternal synonym\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsynonyme externe\fR 
.LP
	\fIS | \fR \ \fIsin\*'onimo externo\fR 
.PP
An \fIexternal synonym\fR of a predefined \fIsort\fR whose \fIvalue\fR 
is not specified in the \fIsystem specification\fR . [4.3.1] 
.RT
.sp 1P
.LP
	\fBextract!\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIextract!\fR 
.LP
	\fIS | \fR \ \fIextraer!; extract!\fR 
.PP
\fIExtract\fR is an \fIoperator\fR which is implied in an \fIexpression\fR 
when a \fIvariable\fR is immediately followed by bracketed \fIexpression(s)\fR 
. 
[5.4.2.4, 5.6.8]
.RT
.sp 1P
.LP
	\fBflow line\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIligne de liaison\fR 
.LP
	\fIS | \fR \ \fIl\*'inea de flujo\fR 
.PP
A \fIflow line\fR is a \fIsymbol\fR used to connect \fIareas\fR in a \fIcontrol\fR 
\fIflow diagram\fR . [2.2.4, 2.6.7.2.2] 
.RT
.sp 1P
.LP
	\fBformal parameter\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIparam\*`etre formel\fR 
.LP
	\fIS | \fR \ \fIpar\*'ametro formal\fR 
.PP
A \fIformal parameter\fR is a \fIvariable name\fR to which \fIactual values\fR 
are assigned or which are replaced by \fIactual variables\fR . 
[2.4.4, 2.4.5, 4.2, 4.10]
.RT
.sp 1P
.LP
	\fBformal parameter list\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIliste de param\*`etres formels\fR 
.LP
	\fIS | \fR \ \fIlista de par\*'ametros formales\fR 
.PP
A \fIformal parameter list\fR is list of a \fIformal
parameters\fR .
.bp
.RT
.sp 1P
.LP
\fR \fR 	\fBfunctional behaviour\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIcomportement fonctionnel\fR 
.LP
	\fIS | \fR \ \fIcomportamiento funcional\fR 
.PP
\fIFunctional behaviour\fR is a synonym for \fIbehaviour\fR .
.RT
.sp 1P
.LP
	\fBgeneral option area\fR 
.sp 9p
.RT
.LP
	\fIF:\ zone d'option g\*'en\*'erale\fR 
.LP
	\fIS:\ \*'area de opci\*'on general\fR 
.PP
The \fIgeneral option area\fR is the \fISDL/GR\fR representation of an
\fIoption\fR . [4.3.3]
.RT
.sp 1P
.LP
	\fBgeneral parameters\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIparam\*`etres g\*'en\*'eraux\fR 
.LP
	\fIS | \fR \ \fIpar\*'ametros generales\fR 
.PP
The \fIgeneral parameters\fR in both a \fIspecification\fR and a
\fIdescription\fR of a \fIsystem\fR relate to such matters as temperature 
limits, 
construction, exchange capacity, grade of service,\ etc., and are not defined 
in \fISDL\fR . [1.1] 
.RT
.sp 1P
.LP
	\fBgenerator\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIg\*'en\*'erateur\fR 
.LP
	\fIS | \fR \ \fIgenerador\fR 
.PP
A \fIgenerator\fR is an incomplete \fInewtype\fR description. Before it
assumes the status of a \fInewtype\fR , a \fIgenerator\fR must be instantiated 
by 
providing the missing information. [5.4.1.1.2]
.RT
.sp 1P
.LP
	\fBgraph\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIgraphe\fR 
.LP
	\fIS | \fR \ \fIgr\*'afico\fR 
.PP
A \fIgraph\fR in the \fIabstract syntax\fR is a part of an \fISDL\fR 
\fIspecification\fR such as \fIprocedure graph\fR or a \fIprocess graph\fR .
.RT
.sp 1P
.LP
	\fBground expression\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIexpression close\fR 
.LP
	\fIS | \fR \ \fIexpresi\*'on fundamental\fR 
.PP
A \fIground expression\fR is an \fIexpression\fR containing only
\fIoperators\fR , \fIsynonyms\fR and \fIliterals\fR . [5.4.2.2]
.RT
.sp 1P
.LP
	\fBhierarchical structure\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIstructure hi\*'erarchique\fR 
.LP
	\fIS | \fR \ \fIestructure jer\*`arquica\fR 
.PP
A \fIhierarchical structure\fR is a structure of a \fIsystem\fR 
\fIspecification\fR where \fIpartitioning\fR and \fIrefinement\fR allow 
different views of the \fIsystem\fR at different \fIlevels of abstraction.\fR 
\fIHierarchical structures\fR allow the management of complex \fIsystem 
specifications\fR . See also \fIblock tree\fR \fIdiagram\fR . [3.1] 
.RT
.sp 1P
.LP
	\fBidentifier\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIidentificateur\fR 
.LP
	\fIS | \fR \ \fIidentificador\fR 
.PP
An \fIidentifier\fR is the unique identification of an object, formed from 
a \fIqualifier part\fR and a \fIname\fR . [2.2.2] 
.bp
.RT
.LP
\fR 
.sp 1P
.LP
	\fBimperative operator\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIop\*'erateur imp\*'eratif\fR 
.LP
	\fIS | \fR \ \fIoperador imperativo\fR 
.PP
An \fIimperative operator\fR is a now \fIexpression, view expression,\fR 
\fItimer active expression, import expression\fR or one of the \fIPId expressions:\fR 
\fISELF, PARENT, OFFSPRING\fR or \fISENDER\fR . [5.5.4] 
.RT
.sp 1P
.LP
	\fBimplicit transition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fItransition implicite\fR 
.LP
	\fIS | \fR \ \fItransici\*'on impl\*'icita\fR 
.PP
An \fIimplicit transition\fR is in the \fIconcrete syntax\fR initiated
by a \fIsignal\fR in the \fIcomplete valid input signal set\fR and not 
specified in an\fR \fIinput\fR or \fIsave\fR for the \fIstate\fR . An \fIimplicit 
transition\fR contains no 
\fIaction\fR and leads directly back to the same \fIstate\fR [4.6]
.RT
.sp 1P
.LP
	\fBimport\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIimport\fR 
.LP
	\fIS | \fR \ \fIimportaci\*'on\fR 
.PP
The term \fIimport\fR is a synonym for \fIimport operation\fR .
[4.13]
.RT
.sp 1P
.LP
	\fBimported variable\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIvariable import\*'ee\fR 
.LP
	\fIS | \fR \ \fIvariable importada\fR 
.PP
An \fIimported variable\fR is a \fIvariable\fR used in an \fIimport\fR 
\fIoperation\fR . [4.13]
.RT
.sp 1P
.LP
	\fBimporter\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIimporteur\fR 
.LP
	\fIS | \fR \ \fIimportador\fR 
.PP
An \fIimporter\fR of an \fIimported variable\fR is the \fIprocess instance\fR 
which \fIimports\fR the \fIvalue\fR . [4.13] 
.RT
.sp 1P
.LP
	\fBimport operation\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIop\*'eration d'importation\fR 
.LP
	\fIS | \fR \ \fIoperaci\*'on de importaci\*'on\fR 
.PP
An \fIimport operation\fR is the operation that yields \fIvalue\fR of an 
\fIexported variable\fR . [4.13] 
.RT
.sp 1P
.LP
	\fBIN variable\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIvariable \*QIN\*U\fR 
.LP
	\fIS | \fR \ \fIvariable IN\fR 
.PP
An \fIIN variable\fR is a \fIformal parameter\fR attribute denoting the
case when a \fIvalue\fR is passed to a \fIprocedure\fR via an \fIactual 
parameter\fR . 
[2.4.5]
.RT
.sp 1P
.LP
	\fBIN/OUT variable\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIvariable \*QIN/OUT\*U\fR 
.LP
	\fIS | \fR \ \fIvariable IN/OUT\fR 
.PP
An \fIIN/OUT variable\fR is a \fIformal parameter\fR attribute denoting
the case when a \fIformal parameter name\fR is used as a synonym for the 
\fIvariable\fR (i.e.\ the \fIactual parameter\fR must be a \fIvariable\fR 
. [2.4.5] 
.bp
.RT
.sp 1P
.LP
\fR 	\fBin\(hyconnector\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIconnecteur d'entr\*'ee\fR 
.LP
	\fIS | \fR \ \fIconector de entrada\fR 
.PP
An \fIin\(hyconnector\fR is a \fIconnector\fR .
.RT
.sp 1P
.LP
	\fBinfix operator\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIop\*'erateur infixe\fR 
.LP
	\fIS | \fR \ \fIoperador infijo\fR 
.PP
An \fIinfix operator\fR is one of the predefined dyadic \fIoperators\fR 
of \fISDL\fR (=>, OR, XOR, AND, IN, /=, =, >, <, < =, >=, +, \(em, //, 
*, /, MOD, REM) 
which are placed between its two arguments. [5.4.1.1]
.RT
.sp 1P
.LP
	\fBinformal text\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fItexte informel\fR 
.LP
	\fIS | \fR \ \fItexto informal\fR 
.PP
\fIInformal text\fR is text included in an \fISDL specification\fR for
which \fIsemantics\fR are not defined by \fISDL\fR , but through some other 
model. 
\fIInformal text\fR is enclosed in apostrophes. [2.2.3]
.RT
.sp 1P
.LP
	\fBinitial algebra\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIalg\*`ebre initiale\fR 
.LP
	\fIS | \fR \ \fI\*'algebra inicial\fR 
.PP
An \fIinitial algebra\fR is the formalism for defining \fIabstract data\fR 
\fItypes\fR . [5.3] 
.RT
.sp 1P
.LP
	\fBinlet\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIacc\*`es entrant\fR 
.LP
	\fIS | \fR \ \fIacceso de entrada\fR 
.PP
An \fIinlet\fR represents a line, such as a \fIchannel\fR or a \fIflow\fR 
\fIline\fR , entering an \fISDL/GR macro call\fR . [4.2.3]
.RT
.sp 1P
.LP
	\fBinput\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIentr\*'ee\fR 
.LP
	\fIS | \fR \ \fIentrada\fR 
.PP
An \fIinput\fR is the consumption of a \fIsignal\fR from the \fIinput port\fR 
which starts a \fItransition\fR . During the consumption of a \fIsignal\fR 
, the \fIvalues\fR associated with the \fIsignal\fR become available to 
the \fIprocess instance\fR . 
[2.6.4, 4.10.2]
.RT
.sp 1P
.LP
	\fBinput area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone d'entr\*'ee\fR 
.LP
	\fIS | \fR \ \fI\*'area de entrada\fR 
.PP
An \fIinput area\fR is the \fISDL/GR\fR representation of an \fIinput\fR .
[2.6.4]
.RT
.sp 1P
.LP
	\fBinput port\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIport d'entr\*'ee\fR 
.LP
	\fIS | \fR \ \fIpuerto de entrada\fR 
.PP
An \fIinput port\fR of a \fIprocess\fR is a queue which receives and
retains \fIsignals\fR in the order of arrival until the \fIsignals\fR are 
consumed by an \fIinput\fR . The \fIinput port\fR may contain any number 
of \fIretained signals\fR . 
[2.4.4]
.bp
.RT
.LP
\fR 
.sp 1P
.LP
	\fBinstance\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIinstance\fR 
.LP
	\fIS | \fR \ \fIinstancia\fR 
.PP
An \fIinstance\fR of a \fItype\fR is an object which has the properties 
of the \fItype\fR (given in the definition). [1.3.1] 
.RT
.sp 1P
.LP
	\fBinstantiation\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIinstantiation\fR 
.LP
	\fIS | \fR \ \fIinstanciaci\*'on\fR 
.PP
\fIInstantiation\fR is the creation of an \fIinstance\fR of a \fItype\fR .
[1.3.1]
.RT
.sp 1P
.LP
	\fBinteger\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIentier (integer)\fR 
.LP
	\fIS | \fR \ \fIentero; integer\fR 
.PP
\fIInteger\fR is a \fIsort\fR defined in a predefined \fIpartial type\fR 
\fIdefinition\fR for which the \fIvalues\fR are these of mathematical integers 
(. |  | , \(em2, \(em1, 0, +1, +2, . |  | ). For the \fIsort integer\fR 
the predefined \fIoperators\fR are +, \(em, *, / and the \fIordering operators\fR 
. [5.6.5] 
.RT
.sp 1P
.LP
	\fBinteraction diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme d'interaction\fR 
.LP
	\fIS | \fR \ \fIdiagrama de interacci\*'on\fR 
.PP
An \fIinteraction diagram\fR is a \fIblock diagram, system diagram,\fR 
\fIchannel substructure diagram,\fR or \fIblock substructure diagram\fR .
.RT
.sp 1P
.LP
	\fBkeyword\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fImot cl\*'e\fR 
.LP
	\fIS | \fR \ \fIpalabra clave\fR 
.PP
A \fIkeyword\fR is a reserved \fIlexical unit\fR in the \fIconcrete textual\fR 
\fIsyntax\fR . [2.2.1] 
.RT
.sp 1P
.LP
	\fBlabel\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fI\*'etiquette\fR 
.LP
	\fIS | \fR \ \fIetiqueta\fR 
.PP
A \fIlabel\fR is a \fIname\fR followed by a colon and is used in the
\fIconcrete textual syntax\fR for connection purposes. [2.6.6]
.RT
.sp 1P
.LP
	\fBlevel\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIniveau\fR 
.LP
	\fIS | \fR \ \fInivel\fR 
.PP
The term \fIlevel\fR is a synonym for \fIlevel of abstraction\fR .
.RT
.sp 1P
.LP
	\fBlevel of abstraction\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIniveau d'abstraction\fR 
.LP
	\fIS | \fR \ \fInivel de abstracci\*'on\fR 
.PP
A \fIlevel of abstraction\fR is one of the levels of a \fIblock tree\fR 
\fIdiagram\fR . A description of a \fIsystem\fR is one \fIblock\fR at the 
highest \fIlevel of\fR \fIabstraction\fR and is shown as a single \fIblock\fR 
at the top of a \fIblock tree\fR 
\fIdiagram\fR . [3.2.1]
.bp
.RT
.sp 1P
.LP
\fR 	\fBlexical rules\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIr\*`egles lexicales\fR 
.LP
	\fIS | \fR \ \fIreglas l\*'exicas\fR 
.PP
\fILexical rules\fR are rules which define how \fIlexical units\fR are
built from characters. [2.2.1, 4.2.1]
.RT
.sp 1P
.LP
	\fBlexical unit\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIunit\*'es lexicales\fR 
.LP
	\fIS | \fR \ \fIunidad l\*'exica\fR 
.PP
\fILexical units\fR are the terminal \fIsymbols\fR of the \fIconcrete\fR 
\fItextual syntax\fR . [2.2.1]
.RT
.sp 1P
.LP
	\fBliteral\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIlitt\*'eral\fR 
.LP
	\fIS | \fR \ \fIliteral\fR 
.PP
A \fIliteral\fR denotes a \fIvalue\fR . [2.3.3, 5.1.2, 5.4.1.14]
.RT
.sp 1P
.LP
	\fBmacro\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fImacro\fR 
.LP
	\fIS | \fR \ \fImarco\fR 
.PP
A \fImarcro\fR is a named collection of syntactic or textual items,
which replaces the \fImacro call\fR before the meaning of the \fISDL\fR 
representation is considered (i.e.,\ a \fImacro\fR has meaning only when 
replaced in a particular context). [4.2] 
.RT
.sp 1P
.LP
	\fBmacro call\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIappel de macro\fR 
.LP
	\fIS | \fR \ \fIllamada a (de) macro\fR 
.PP
A \fImacro call\fR is an indication of a place where the \fImacro\fR 
\fIdefinition\fR with the same \fIname\fR should be expanded. [4.2.3]
.RT
.sp 1P
.LP
	\fBmacro definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de macro\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de macro\fR 
.PP
A \fImacro definition\fR is the definition of a \fImacro\fR in \fISDL/PR\fR 
. [4.2.2] 
.RT
.sp 1P
.LP
	\fBmacro diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme de macro\fR 
.LP
	\fIS | \fR \ \fIdiagrama de macro\fR 
.PP
A \fImacro diagram\fR is the definition of a \fImacro\fR in \fISDL/GR\fR .
[4.2.2]
.RT
.sp 1P
.LP
	\fBmake!\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fImake!\fR 
.LP
	\fIS | \fR \ \fIhacer!; make!\fR 
.PP
\fIMake!\fR is an operation only used in \fIdata type\fR definitions fo
form a \fIvalue\fR of a complex type (e.g.,\ \fIstructured sort\fR ).
[5.4.1.10, 5.6.8]
.bp
.RT
.LP
\fR 
.sp 1P
.LP
	\fBmerge area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de fusion\fR 
.LP
	\fIS | \fR \ \fI\*'area de fusi\*'on\fR 
.PP
A \fImerge area\fR is where one \fIflow line\fR connects to another.
[2.6.7.2.2]
.RT
.sp 1P
.LP
	\fBMeta IV\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIMeta IV\fR 
.LP
	\fIS | \fR \ \fIMeta IV\fR 
.PP
\fIMeta IV\fR is a formal notation for expressing the \fIabstract\fR 
\fIsyntax\fR of a language. [1.5.1]
.RT
.sp 1P
.LP
\fR 	\fBmodel\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fImod\*`ele\fR 
.LP
	\fIS | \fR \ \fImodelo\fR 
.PP
A \fImodel\fR gives the mapping for \fIshorthand\fR notations expressed\fR 
in terms of previously defined \fIconcrete syntax\fR . [1.4.1, 1.4.2] 
.RT
.sp 1P
.LP
	\fBmodify!\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fImodify!\fR 
.LP
	\fIS | \fR \ \fImodificar!; modify!\fR 
.PP
\fIModify\fR is an \fIoperator\fR which is implied in \fIexpressions\fR 
when a \fIvariable\fR is immediately followed by bracketed expressions 
and then :=. Within axioms \fImodify!\fR is used explicitly (see \fIextract!\fR 
) [5.4.1.10, 5.6.8] 
.RT
.sp 1P
.LP
	\fBname\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fInom\fR 
.LP
	\fIS | \fR \ \fInombre\fR 
.PP
A \fIname\fR is a \fIlexical unit\fR used to name \fISDL\fR objects.
[2.2.1, 2.2.2]
.RT
.sp 1P
.LP
	\fBnatural\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fInaturel\fR 
.LP
	\fIS | \fR \ \fInatural\fR 
.PP
\fINatural\fR is a \fIsyntype\fR defined in a predefined \fIpartial type\fR 
\fIdefinition\fR for which the \fIvalues\fR are the non\(hynegative integers 
(i.e.,\ 0, 1, 2,  |  |  | ). The \fIoperators\fR are the \fIoperators\fR 
of the \fIsort integer\fR . 
[5.6.6]
.RT
.LP
\fR 
.sp 1P
.LP
	\fBnewtype\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fInouveau type (newtype)\fR 
.LP
	\fIS | \fR \ \fIniotipo\fR 
.PP
A \fInewtype\fR introduces a \fIsort\fR , a set of \fIoperators\fR , and 
a set of \fIequations\fR . Note that the term \fInewtype\fR might be confusing 
because 
actually a new \fIsort\fR is introduced, but \fInewtype\fR is maintained 
for historical reasons. [5.2.1] 
.RT
.sp 1P
.LP
	\fBnode\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fInoeud\fR 
.LP
	\fIS | \fR \ \fInodo\fR 
.PP
In the \fIabstract syntax\fR , a \fInode\fR is a designation of one of 
the basic concepts of \fISDL\fR  |  
.bp
.RT
.sp 1P
.LP
\fR 	\fBnote\fR 
.sp 9p
.RT
.LP
	\fIF:\ note\fR 
.LP
	\fIS:\ nota\fR 
.PP
A \fInote\fR is text enclosed by /* | nd | / which has no \fISDL\fR defined
semantics. See \fIcomment\fR . [2.2.1]
.RT
.sp 1P
.LP
	\fBnull\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fInull\fR 
.LP
	\fIS | \fR \ \fInull; nulo\fR 
.PP
\fINull\fR is the \fIliteral\fR of \fIsort PId\fR . [5.6.10]
.RT
.sp 1P
.LP
	\fBOFFSPRING\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIDESCENDANT (OFFSPRING)\fR 
.LP
	\fIS | \fR \ \fIOFFSPRING; VASTAGO\fR 
.PP
\fIOFFSPRING\fR is an \fIexpression\fR of \fIsort PId\fR . When \fIOFFSPRING\fR 
is evaluated in a \fIprocess\fR it gives the \fIPId\(hyvalues\fR of the 
\fIprocess\fR most 
recently \fIcreated\fR by this \fIprocess\fR . If the \fIprocess\fR has 
not \fIcreated\fR any 
\fIprocesses\fR , the result of the evaluation of \fIOFFSPRING\fR is \fInull\fR 
. 
[2.4.4, 5.5.4.3]
.RT
.sp 1P
.LP
	\fBoperator\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIop\*'erateur\fR 
.LP
	\fIS | \fR \ \fIoperador\fR 
.PP
An \fIoperator\fR is a denotation for an operation. \fIOperators\fR are
defined in a \fIpartial type definition\fR . For example +, \(em, *, /, 
are \fInames\fR for \fIoperators\fR defined for \fIsort integer\fR . [5.1.2, 
5.1.3]
.RT
.sp 1P
.LP
	\fBoperator signature\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsignature d'op\*'erateur\fR 
.LP
	\fIS | \fR \ \fIsignatura de operador\fR 
.PP
An \fIoperator signature\fR defines the \fIsort(s)\fR of the \fIvalues\fR 
to which the \fIoperator\fR can be applied and the \fIsort\fR of the resulting 
\fIvalue\fR . [5.2.2] 
.RT
.sp 1P
.LP
	\fBoption\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIoption\fR 
.LP
	\fIS | \fR \ \fIopci\*'on\fR 
.PP
An \fIoption\fR is a \fIconcrete syntax\fR construct in a generic \fISDL\fR 
\fIsystem specification\fR allowing different \fIsystem\fR structures to 
be chosen 
before the \fIsystem\fR is interpreted. [4.3.3,
4.3.4]
.RT
.sp 1P
.LP
	\fBordering operators\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIop\*'erateurs de relation d'ordre\fR 
.LP
	\fIS | \fR \ \fIoperadores de ordenaci\*'on\fR 
.PP
The \fIordering operators\fR are <, <=, > or >=.
[5.4.1.8]
.RT
.sp 1P
.LP
	\fBout connector\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIconnecteur de sortie\fR 
.LP
	\fIS | \fR \ \fIconector de salida\fR 
.PP
An \fIout\(hyconnector\fR is a connector.
.bp
.RT
.LP
\fR 
.sp 1P
.LP
	\fBoutlet\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIacc\*`es sortant\fR 
.LP
	\fIS | \fR \ \fIacceso de salida\fR 
.PP
An \fIoutlet\fR represents a line, such as a \fIchannel\fR or \fIflow line\fR 
, existing a \fImacro diagram\fR . [4.2.2] 
.RT
.sp 1P
.LP
	\fBoutput\fR 
.sp 9p
.RT
.LP
	\fIF:\ sortie\ \fR 
.LP
	\fIS:\ salida\fR 
.PP
An \fIoutput\fR is an \fIaction\fR within a \fItransition\fR which generates
a \fIsignal instance\fR .
.RT
.sp 1P
.LP
	\fBoutput area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de sortie\fR 
.LP
	\fIS | \fR \ \fI\*'area de salida\fR 
.PP
The \fIoutput area\fR in a \fIcontrol flow diagram\fR represents the
\fISDL/GR\fR concept of an \fIoutput\fR . [2.7.4]
.RT
.sp 1P
.LP
	\fBpage\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIpage\fR 
.LP
	\fIS | \fR \ \fIp\*'agina\fR 
.PP
A \fIpage\fR is one of the components of a physical partitioning of a \fIdiagram\fR 
. [2.2.5] 
.RT
.sp 1P
.LP
	\fBPARENT\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIPARENT\fR 
.LP
	\fIS | \fR \ \fIPARENT; PROGENITOR\fR 
.PP
\fIPARENT\fR is a \fIPId expression\fR . When a \fIprocess\fR evaluates this
\fIexpression\fR , the result is the \fIPId\(hyvalue\fR of the parent \fIprocess\fR 
. If the 
\fIprocess\fR was created at \fIsystem\fR initialization time, the result 
is \fInull\fR . [2.4.4, 5.5.4.3] 
.RT
.sp 1P
.LP
	\fBpartial type definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efintiion partielle de type\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on parcial de tipo\fR 
.PP
The \fIpartial type definition\fR for a \fIsort\fR defines some of the
properties related to the \fIsort\fR . A \fIpartial type definition\fR 
is part of a 
\fIdata type\fR definition. [5.2.1]
.RT
.sp 1P
.LP
	\fBpartitioning\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsubdivision\fR 
.LP
	\fIS | \fR \ \fIpartici\*'on\fR 
.PP
\fIPartitioning\fR is the subdivision of a unit into smaller
components which when taken as a whole have the same \fIbehaviour\fR as the
original unit. \fIPartitioning\fR does not affect the static interface 
of a unit. [3.1, 3.2] 
.RT
.sp 1P
.LP
	\fBPId\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIPId\fR 
.LP
	\fIS | \fR \ \fIPId\fR 
.PP
\fIPId\fR is a \fIsort\fR defined in a predefined \fIpartial type\fR 
\fIdefinition\fR for which there is one \fIliteral\fR , \fInull\fR . \fIPId\fR 
is an abbreviation for process instance identifier, and the \fIvalues\fR 
of the \fIsorts\fR are used to 
identify \fIprocess instances\fR . [5.5.4.3, 5.6.10]
.RT
.sp 1P
.LP
	\fBpowerset\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fImode ensembliste\fR 
.LP
	\fIS | \fR \ \fIconjunista\fR 
.PP
\fIPowerset\fR is the \fIpredefined generator\fR used to introduce
mathematical sets. The \fIoperators\fR for \fIpowerset\fR are IN, Incl, 
Del, union, 
insersection and the \fIordering operators\fR .
[5.6.9]
.bp
.RT
.LP
\fR 
.sp 1P
.LP
	\fBpredefined data\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdonn\*'ees pr\*'ed\*'efinies\fR 
.LP
	\fIS | \fR \ \fIdatos predefinidos\fR 
.PP
For simplicity of description the term \fIpredefined data\fR is
applied to both predefined \fInames\fR for \fIsorts\fR introduced by \fIpartial 
type\fR 
\fIdefinitions\fR and predefined \fInames\fR for \fIdata type generators\fR 
. \fIBoolean,\fR 
\fIcharacter, chartstring, duration, integer, natural PId, real\fR and 
\fItime\fR are \fIsort names\fR which are predefined. \fIArray, powerset\fR 
, and \fIstring\fR are \fIdata\fR \fItype generator names\fR which are 
predefined. \fIPredefined data\fR are defined 
implicitly at \fIsystem level\fR in all \fISDL systems\fR . [5.6]
.RT
.sp 1P
.LP
	\fBprocedure\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIproc\*'edure\fR 
.LP
	\fIS | \fR \ \fIprocedimiento\fR 
.PP
A \fIprocedure\fR is an encapsulation of the \fIbehaviour\fR of a
\fIprocess\fR . A \fIprocedure\fR is defined in one place but may be referred 
to several times within the same \fIprocess\fR . See \fIformal parameter\fR 
and \fIactual\fR 
\fIparameter\fR . [2.4.5]
.RT
.sp 1P
.LP
	\fBprocedure call\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIappel de proc\*'edure\fR 
.LP
	\fIS | \fR \ \fIllamada a (de) procedimiento\fR 
.PP
A \fIprocedure call\fR is the invocation of a named \fIprocedure\fR for
interpretation of the \fIprocedure\fR and passing \fIactual parameters\fR 
to the 
\fIprocedure\fR . [2.7.3]
.RT
.sp 1P
.LP
	\fBprocedure call area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone d'appel de proc\*'edure\fR 
.LP
	\fIS | \fR \ \fI\*'area de llamada a (de) procedimiento\fR 
.PP
The \fIprocedure call area\fR is the \fISDL/GR\fR representation of a
\fIprocedure call\fR . [2.7.3]
.RT
.sp 1P
.LP
	\fBprocedure definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de proc\*'edure\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de procedimiento\fR 
.PP
A \fIprocedure definition\fR is the \fISDL/PR\fR definition of a
\fIprocedure\fR . [2.4.5]
.RT
.sp 1P
.LP
	\fBprocedure diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme de proc\*'edure\fR 
.LP
	\fIS | \fR \ \fIdiagrama de procedimiento\fR 
.PP
A \fIprocedure diagram\fR is the \fISDL/GR\fR representation of a
\fIprocedure\fR . [2.4.5]
.RT
.sp 1P
.LP
	\fBprocedure graph\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIgraphe de proc\*'edure\fR 
.LP
	\fIS | \fR \ \fIgr\*'afico de procedimiento\fR 
.PP
A \fIprocedure graph\fR is a nonterminal in the \fIabstract syntax\fR 
representing a \fIprocedure\fR . [2.4.5]
.bp
.RT
.LP
\fR 
.sp 1P
.LP
	\fBprocedure return\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIretour de proc\*'edure\fR 
.LP
	\fIS | \fR \ \fIretorno de procedimiento\fR 
.PP
\fIProcedure return\fR is a synonym for \fIreturn\fR .
.RT
.sp 1P
.LP
	\fBprocess\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIprocessus\fR 
.LP
	\fIS | \fR \ \fIproceso\fR 
.PP
A \fIprocess\fR is a communicating extended finite state machine.
Communication can take place via \fIsignals\fR or shared \fIvariables\fR . The
\fIbehaviour\fR of a \fIprocess\fR depends on the order of arrival of \fIsignals\fR 
in its \fIinput port\fR . [2.4.4] 
.RT
.sp 1P
.LP
	\fBprocess area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de processus\fR 
.LP
	\fIS | \fR \ \fI\*'area de proceso\fR 
.PP
A \fIprocess area\fR in \fISDL/GR\fR is the representation of a \fIprocess\fR 
or a reference to a \fIprocess\fR in an \fIinteraction diagram\fR . [2.4.3] 
.RT
.sp 1P
.LP
	\fBprocess definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de processus\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de processo\fR 
.PP
A \fIprocess definition\fR is the \fISDL/PR\fR representation of a
\fIprocess\fR . [2.4.4]
.RT
.sp 1P
.LP
	\fBprocess diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme de processus\fR 
.LP
	\fIS | \fR \ \fIdiagrama de proceso\fR 
.PP
A \fIprocess diagram\fR is the \fISDL/GR\fR representation of the
definition of a \fIprocess\fR . [2.4.4]
.RT
.sp 1P
.LP
	\fBprocess graph\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIgraphe de processus\fR 
.LP
	\fIS | \fR \ \fIgr\*'afico de proceso\fR 
.PP
A \fIprocess graph\fR is nonterminal in the \fIabstract syntax\fR 
representing a \fIprocess\fR . [2.4.4]
.RT
.sp 1P
.LP
	\fBprocess instance\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIinstance de processus\fR 
.LP
	\fIS | \fR \ \fIinstancia de proceso\fR 
.PP
A \fIprocess instance\fR is a dynamically created \fIinstance\fR of\fR a
\fIprocess\fR . See \fISELF, SENDER, PARENT,\fR and \fIOFFSPRING\fR [2.4.4]
.RT
.sp 1P
.LP
	\fBqualifier\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIpartie qualificative (qualificatif)\fR 
.LP
	\fIS | \fR \ \fIcalificador\fR 
.PP
The \fIqualifier\fR is part of an \fIidentifier\fR which is the extra
information to the \fIname\fR part of the \fIidentifier\fR to ensure uniqueness. 
\fIQualifiers\fR are always present in the \fIabstract syntax\fR , but 
only have to be used as far as needed for uniqueness in the \fIconcrete 
syntax\fR when the 
\fIqualifier\fR of an \fIidentifier\fR cannot be derived from the context 
of the use of the \fIname\fR part. [2.2.2] 
.RT
.sp 1P
.LP
	\fBreal\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIr\*'eel\fR 
.LP
	\fIS | \fR \ \fIreal\fR 
.PP
\fIReal\fR is a \fIsort\fR defined in a predefined \fIpartial type\fR 
\fIdefinition\fR for which the \fIvalues\fR are the numbers which can be 
presented by one \fIInteger\fR divided by another. The predefined \fIoperators\fR 
for the \fIsort\fR \fIreal\fR have the same \fInames\fR as the \fIoperators\fR 
of \fIsort integer\fR . 
[5.6.7]
.bp
.RT
.LP
\fR 
.sp 1P
.LP
	\fBrefinement\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIreaffinement\fR 
.LP
	\fIS | \fR \ \fIrefinamiento\fR 
.PP
\fIRefinement\fR is the addition of new details to the funtionality at 
a certain \fIlevel of abstraction\fR . The \fIrefinement\fR of a \fIsystem\fR 
causes an 
enrichment in its \fIbehaviour\fR or its capabilities to handle more types of
\fIsignals\fR and information, including those \fIsignals\fR to and from the
\fIenvironment\fR . Compare with \fIpartitioning\fR . [3.3]
.RT
.sp 1P
.LP
	\fBremote definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition distante\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on remota\fR 
.PP
A \fIremote definition\fR is a syntactic means of distributing a
\fIsystem definition\fR into several parts and relating the parts to each 
other. [2.4.1] 
.RT
.sp 1P
.LP
	\fBreset\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIreset (r\*'einitialisation)\fR 
.LP
	\fIS | \fR \ \fIreincializar; reponer\fR 
.PP
\fIReset\fR is an operation defined for \fItimers\fR which allows \fItimers\fR 
to be made inactive. See \fIactive timer\fR . [2.8] 
.RT
.sp 1P
.LP
	\fBretained signal\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsignal retenu\fR 
.LP
	\fIS | \fR \ \fIse\o"n~"al retenida\fR 
.PP
A \fIretained signal\fR is a \fIsignal\fR in the \fIinput port\fR of a
\fIprocess\fR , i.e.,\ a \fIsignal\fR which has been received but not consumed 
by the 
\fIprocess\fR . [2.4.4]
.RT
.sp 1P
.LP
	\fBreturn\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIretour\fR 
.LP
	\fIS | \fR \ \fIretorno\fR 
.PP
The \fIreturn\fR of a \fIprocedure\fR is the transfer of control to the
calling \fIprocedure\fR or \fIprocess\fR . [2.6.7.2.4]
.RT
.sp 1P
.LP
	\fBreveal attribute\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIattribut d'exposition\fR 
.LP
	\fIS | \fR \ \fIatributo revelado\fR 
.PP
A \fIvariable\fR owned by a \fIprocess\fR may have a \fIreveal attribute\fR 
, in which case another \fIprocess\fR in the same \fIblock\fR is permitted 
to view the 
\fIvalue\fR associated with the \fIvariable\fR . See \fIview definition\fR .
[2.6.1.1]
.RT
.sp 1P
.LP
	\fBsave\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fImise en r\*'eserve\fR 
.LP
	\fIS | \fR \ \fIconservaci\*'on\fR 
.PP
A \fIsave\fR is the declaration of those \fIsignals\fR that should not 
be consumed in a given \fIstate\fR . [2.6.5] 
.RT
.sp 1P
.LP
	\fBsave area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de mise en r\*'eserve\fR 
.LP
	\fIS | \fR \ \fI\*'area de conservaci\*'on\fR 
.PP
The \fIsave area\fR is the \fISDL/GR\fR representation of a \fIsave\fR .
[2.6.5]
.bp
.RT
.sp 1P
.LP
\fR 	\fBsave signal set\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIensemble de signaux de mise en r\*'eserve\fR 
.LP
	\fIS | \fR \ \fIconjunto de se\o"n~"ales de conservaci\*'on\fR 
.PP
The \fIsave signal set\fR of a \fIstate\fR is the set of saved \fIsignals\fR 
for that \fIstate\fR . [2.6.5] 
.RT
.sp 1P
.LP
	\fBSDL (CCITT Specification and Description Language)\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fILDS (langage de description et de sp\*'ecification du\fR 
\fICCITT)\fR 
.LP
	\fIS | \fR \ \fILED (lenguaje de especificaci\*'on y descripci\*'on del\fR 
\fICCITT)\fR 
.PP
CCITT \fISDL\fR (\fISpecification and Description Language\fR ) is a formal 
language providing a set of constructs of the \fIspecification\fR for the 
functionality of a system.
.RT
.sp 1P
.LP
	\fBSDL/GR\fR 
.sp 9p
.RT
.LP
	\fIF:\ LDS/GR\fR 
.LP
	\fIS:\ LED/GR\fR 
.PP
\fISDL/GR\fR is the graphical representation in \fISDL\fR . The \fIgrammar\fR 
for \fISDL/GR\fR is defined by the \fIconcrete graphical grammar\fR and 
the \fIcommon\fR \fItextual grammar\fR . [1.2] 
.RT
.sp 1P
.LP
	\fBSDL/PE\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fILDS/PE\fR 
.LP
	\fIS | \fR \ \fILED/EP\fR 
.PP
\fISDL/PE\fR is a set of icons which can be used in conjunction with the 
\fIstate symbol\fR of \fISDL/GR\fR . [Annex\ E] 
.RT
.sp 1P
.LP
	\fBSDL/PR\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fILDS/PR\fR 
.LP
	\fIS | \fR \ \fILED/PR\fR 
.PP
\fISDL/PR\fR is the textual phrase representation in \fISDL\fR . The
\fIgrammar\fR for \fISDL/PR\fR is defined by the \fIconcrete textual grammar\fR 
. 
[1.2]
.RT
.sp 1P
.LP
	\fBscope unit\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIunit\*'e de port\*'ee\fR 
.LP
	\fIS | \fR \ \fIunidad de \*'ambito\fR 
.PP
A \fIscope unit\fR in the \fIconcrete grammar\fR defines the range of
\fIvisibility\fR of \fIidentifiers\fR . Examples of \fIscope units\fR include 
the \fIsystem,\fR \fIblock, process, procedure, partial type definitions\fR 
and \fIservice\fR 
\fIdefinitions\fR . [2.2.2]
.RT
.sp 1P
.LP
	\fBselection\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIs\*'election\fR 
.LP
	\fIS | \fR \ \fIselecci\*'on\fR 
.PP
\fISelection\fR means providing those \fIexternal synonyms\fR needed to
make a specific \fIsystem specification\fR from a generic \fIsystem specification\fR 
. [4.3.3] 
.RT
.sp 1P
.LP
	\fBSELF\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fISELF\fR 
.LP
	\fIS | \fR \ \fISELF; MISMO\fR 
.PP
\fISELF\fR is a \fIPId expression\fR . When a \fIprocess\fR evaluates this
\fIexpression\fR , the result is the \fIPId\(hyvalue\fR of that \fIprocess\fR 
. \fISELF\fR never 
results in the \fIvalue Null\fR . See also \fIPARENT, OFFSPRING, PId\fR .
[2.4.4, 5.5.4.3]
.bp
.RT
.sp 1P
.LP
\fR 	\fBsemantics\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIs\*'emantique\fR 
.LP
	\fIS | \fR \ \fIsem\*'antica\fR 
.PP
\fISemantics\fR gives meaning to an entity: the properties it has, the 
way its \fIbehaviour\fR is interpreted, and any dynamic conditions which 
must be 
fulfilled for the \fIbehaviour\fR of the entity to meet \fISDL\fR rules.
[1.4.1, 1.4.2]
.RT
.sp 1P
.LP
	\fBSENDER\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fISENDER (\*'emetteur)\fR 
.LP
	\fIS | \fR \ \fISENDER; EMISOR\fR 
.PP
\fISENDER\fR is a \fIPId expression\fR . When evaluated \fISENDER\fR yields 
the \fIPId value\fR of the sending \fIprocess\fR of the \fIsignal\fR that 
activated the current \fItransition\fR . [2.4.4, 2.6.4, 5.5.4.3] 
.RT
.sp 1P
.LP
	\fBservice\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIservice\fR 
.LP
	\fIS | \fR \ \fIservicio\fR 
.PP
A \fIservice\fR is an alternative way of specifying a \fIprocess\fR . Each 
\fIservice\fR may define a partial \fIbehaviour\fR of a \fIprocess\fR . 
[4.10]
.RT
.sp 1P
.LP
	\fBservice area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de service\fR 
.LP
	\fIS | \fR \ \fI\*'area de servicio\fR 
.PP
A \fIservice area\fR is either a \fIservice diagram\fR or a reference to 
a \fIservice\fR . [4.10.1] 
.RT
.sp 1P
.LP
	\fBservice definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de service\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de servicio\fR 
.PP
A \fIservice definition\fR is the \fISDL/PR\fR definition of a \fIservice\fR 
. [4.10.1] 
.RT
.sp 1P
.LP
	\fBservice diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme de service\fR 
.LP
	\fIS | \fR \ \fIdiagrama de servicio\fR 
.PP
A \fIservice diagram\fR is the \fISDL/GR\fR definition of a \fIservice\fR .
[4.10]
.RT
.sp 1P
.LP
	\fBset\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIset (initialisation)\fR 
.LP
	\fIS | \fR \ \fIinicializar; poner\fR 
.PP
\fISet\fR is an operation defined for \fItimers\fR which allow \fItimers\fR 
to be made \fIactive\fR . [2.8] 
.bp
.RT
.sp 1P
.LP
\fR 	\fBshorthand notation\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fInotation abr\*'eg\*'ee\fR 
.LP
	\fIS | \fR \ \fInotaci\*'on taquigr\*'afica (o abreviada)\fR 
.PP
A \fIshorthand notation\fR is a \fIconcrete syntax\fR notation providing 
a more compact representation implicitly referring to \fIBasic SDL\fR concepts. 
[1.4.2]
.RT
.sp 1P
.LP
	\fBsignal\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsignal\fR 
.LP
	\fIS | \fR \ \fIse\o"n~"al\fR 
.PP
A \fIsignal\fR is an instance of a signal \fItype\fR communication
information to a \fIprocess instance\fR . [2.5.4]
.RT
.sp 1P
.LP
	\fBsignal definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de signal\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de se\o"n~"al\fR 
.PP
A \fIsignal definition\fR defines a \fInamed signal type\fR and associates 
a list of zero or more \fIsort identifiers\fR with the \fIsignal name\fR 
. This allow 
\fIsignals\fR to carry \fIvalues\fR . [2.5.4]
.RT
.sp 1P
.LP
	\fBsignal list\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIliste de signaux\fR 
.LP
	\fIS | \fR \ \fIlista de se\o"n~"ales\fR 
.PP
A \fIsignal list\fR is a list of \fIsignal identifiers\fR used in
\fIchannel\fR and \fIsignal route definitions\fR to indicate all the \fIsignals\fR 
which 
may be conveyed by the \fIchannel\fR or \fIsignal route\fR in one direction.
[2.5.5]
.RT
.sp 1P
.LP
	\fBsignal list area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de liste de signaux\fR 
.LP
	\fIS | \fR \ \fI\*'area de lista de se\o"n~"ales\fR 
.PP
The \fIsignal list area\fR in an \fIinteraction diagram\fR represents a
\fIsignal list\fR associated with a \fIchannel\fR or \fIsignal route\fR .
[2.5.5]
.RT
.sp 1P
.LP
	\fBsignal route\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIacheminement de signaux\fR 
.LP
	\fIS | \fR \ \fIruta de se\o"n~"ales\fR 
.PP
A \fIsignal route\fR indicates the flow of \fIsignals\fR between a
\fIprocess type\fR and either another \fIprocess type\fR in the same \fIblock\fR 
or the 
\fIchannels\fR connected to the \fIblock\fR . [2.5.2]
.RT
.sp 1P
.LP
	\fBsimple expression\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIexpression simple\fR 
.LP
	\fIS | \fR \ \fIexpresi\*'on simple\fR 
.PP
A \fIsimple expression\fR is an \fIexpression\fR which only contains
\fIoperators, synonyms\fR , and \fIliterals\fR of the predefined \fIsorts\fR .
[4.3.2]
.RT
.sp 1P
.LP
	\fBsort\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsorte\fR 
.LP
	\fIS | \fR \ \fIg\*'enero\fR 
.PP
A \fIsort\fR is a set of \fIvalues\fR with common characteristics. \fISorts\fR 
are always nonempty and disjoint. [2.3.3, 5.1.3] 
.bp
.RT
.sp 1P
.LP
\fR 
	\fBspecification\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsp\*'ecification\fR 
.LP
	\fIS | \fR \ \fIespecificaci\*'on\fR 
.PP
A \fIspecification\fR is a definition of the requirements of a
\fIsystem\fR . A \fIspecification\fR consists of \fIgeneral parameters\fR 
required of the 
\fIsystem\fR and the \fIfunctional specification\fR of its required \fIbehaviour\fR 
. 
\fISpecification\fR may be also used as a shorthand for \*Q\fIspecification\fR 
and/or 
\fIdescription\fR \*U, e.g.,\ in \fISDL specification\fR or \fIsystem specification\fR 
. 
[1.1]
.RT
.sp 1P
.LP
	\fBstart\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'epart\fR 
.LP
	\fIS | \fR \ \fIarranque\fR 
.PP
The \fIstart\fR in a \fIprocess\fR is interpreted before any \fIstate\fR or
\fIaction\fR . The \fIstart\fR initializes the \fIprocess\fR by replacing 
its \fIformal\fR 
\fIparameters\fR by the \fIactual parameters\fR as specified in the \fIcreate\fR 
. 
[2.6.2]
.RT
.sp 1P
.LP
	\fBstate\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fI\*'etat\fR 
.LP
	\fIS | \fR \ \fIestado\fR 
.PP
A \fIstate\fR is a condition in which a \fIprocess instance\fR can consume 
a \fIsignal\fR . [2.6.3] 
.RT
.sp 1P
.LP
	\fBstate area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone d'\*'etat\fR 
.LP
	\fIS | \fR \ \fI\*'area de estado\fR 
.PP
A \fIstate area\fR is the \fISDL/GR\fR representation of one or more
\fIstates\fR . [2.6.3]
.RT
.sp 1P
.LP
	\fBstate picture\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIrepr\*'esentation graphique d'\*'etat\fR 
.LP
	\fIS | \fR \ \fIpictograma de estado\fR 
.PP
A \fIstate picture\fR is a \fIstate symbol\fR incorporating pictorial
elements used to extend \fISDL/GR\fR to \fISDL/PE\fR . [Annex\ E]
.RT
.sp 1P
.LP
	\fBstop\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIarr\* | t\fR 
.LP
	\fIS | \fR \ \fIparada\fR 
.PP
A \fIstop\fR is an action which terminates a \fIprocess instance\fR . When 
a \fIstop\fR is interpreted, all \fIvariables\fR owned by the \fIprocess 
instance\fR are 
destroyed and all \fIretained signals\fR in the \fIinput port\fR are no longer
accessible. [2.6.7.2.3]
.RT
.sp 1P
.LP
	\fBstring\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIcha\* | ne (string)\fR 
.LP
	\fI\*^S:\fR \ \fIcadena; string\fR 
.PP
\fIString\fR is a predefined \fIgenerator\fR used to introduce lists. The 
predefined \fIoperators\fR include Length, First, Last, Substring and 
concatenation. [5.6.3]
.RT
.sp 1P
.LP
	\fBstructured sort\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsorte structur\*'ee\fR 
.LP
	\fIS | \fR \ \fIg\*'enero estructurado\fR 
.PP
A \fIstructured sort\fR is a \fIsort\fR with implicit \fIoperators\fR and
\fIequations\fR and special \fIconcrete syntax\fR for these implicit \fIoperators\fR 
. The \fIstructured sort\fR is used to make \fIvalues\fR with so called 
fields. The \fIvalues\fR of the fields can be \fIaccessed\fR and \fImodified\fR 
independently. 
[5.4.1.10]
.bp
.RT
.LP
\fR 
.sp 1P
.LP
	\fBsubblock\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsous\(hybloc\fR 
.LP
	\fIS | \fR \ \fIsubbloque\fR 
.PP
A \fIsubblock\fR is a \fIblock\fR contained within another \fIblock\fR .
\fISubblocks\fR are formed when a \fIblock\fR is \fIpartitioned\fR . [3.2.1, 
3.2.2] 
.RT
.sp 1P
.LP
	\fBsubchannel\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsous\(hycanal\fR 
.LP
	\fIS | \fR \ \fIsubcanal\fR 
.PP
A \fIsubchannel\fR is a \fIchannel\fR formed when a \fIblock\fR is
\fIpartitioned\fR . A \fIsubchannel\fR connects a \fIsubblock\fR to a boundary 
of the 
\fIpartitioned block\fR or a \fIblock\fR to the boundary of a \fIpartitioned 
channel\fR . [3.2.2, 3.2.3] 
.RT
.sp 1P
.LP
	\fBsubsignal\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsous\(hysignal\fR 
.LP
	\fIS | \fR \ \fIsubse\o"n~"al\fR 
.PP
A \fIsubsignal\fR is a \fIrefinement\fR of a \fIsignal\fR and may be further 
\fIrefined\fR . [3.3] 
.RT
.sp 1P
.LP
	\fBsymbol\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsymbole\fR 
.LP
	\fIS | \fR \ \fIs\*'imbolo\fR 
.PP
A \fIsymbol\fR is a terminal in the \fIconcrete syntaxes\fR . A \fIsymbol\fR 
may be one of a set of shapes in the \fIconcrete graphical syntax\fR . 
.RT
.sp 1P
.LP
	\fBsynonym\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsynonyme\fR 
.LP
	\fIS | \fR \ \fIsin\*'onimo\fR 
.PP
A \fIsynonym\fR is a \fIname\fR which represents a \fIvalue\fR .
[5.4.1.13]
.RT
.sp 1P
.LP
	\fBsyntax diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIdiagramme de syntaxe\fR 
.LP
	\fIS | \fR \ \fIdiagrama de sintaxis\fR 
.PP
\fISyntax diagrams\fR are illustrations of the definitions of the
\fIconcrete textual syntax\fR . [Annex\ C2]
.RT
.sp 1P
.LP
	\fBsyntype\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsyntype\fR 
.LP
	\fIS | \fR \ \fIsintipo\fR 
.PP
A \fIsyntype\fR determines a set of \fIvalues\fR which corresponds to a
subset of the \fIvalues\fR of the parent \fItype\fR . The \fIoperators\fR 
of the \fIsyntype\fR are the same as those of the parent \fItype\fR . 
[5.4.1.9]
.RT
.sp 1P
.LP
	\fBsystem\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsyst\*`eme\fR 
.LP
	\fIS | \fR \ \fIsistema\fR 
.PP
A \fIsystem\fR is a set of \fIblocks\fR connected to each other and the
\fIenvironment\fR by \fIchannels\fR .
.bp
.RT
.sp 1P
.LP
\fR 	\fBsystem definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de syst\*`eme\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de sistema\fR 
.PP
A \fIsystem definition\fR is the \fISDL/PR\fR representation of a
\fIsystem\fR . [2.4.2]
.RT
.sp 1P
.LP
	\fBsystem diagram\fR 
.sp 9p
.RT
.LP
	\fIF | \ diagramme de syst\*`eme\fR 
.LP
	\fIS | \ diagrama de sistema\fR 
.PP
A \fIsystem diagram\fR is the \fISDL/GR\fR representation of a \fIsystem\fR 
. [2.4.2] 
.RT
.sp 1P
.LP
	\fBtask\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIt\* | che\fR 
.LP
	\fIS | \fR \ \fItarea\fR 
.PP
A \fItask\fR is an action within a \fItransition\fR containing either a
sequence of \fIassignment statements\fR or \fIinformal text\fR . The interpretation 
of a \fItask\fR depends on and may act on information held by the \fIsystem\fR 
. 
[2.7.1]
.RT
.sp 1P
.LP
	\fBtask area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de t\* | che\fR 
.LP
	\fIS | \fR \ \fI\*'area de tarea\fR 
.PP
A \fItask area\fR is the SDL/GR representation of a \fItask\fR .
[2.7.1]
.RT
.sp 1P
.LP
	\fBterm\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ terme\fR 
.LP
	\fIS | \fR \ \fIt\*'ermino\fR 
.PP
A \fIterm\fR is syntactically equivalent to an \fIexpression\fR . \fITerms\fR 
are only used in \fIaxioms\fR and are distinguished from \fIexpressions\fR 
for reasons of clarity. [5.2.3, 5.3.3] 
.RT
.sp 1P
.LP
	\fBtext extension symbol\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsymbole d'extension de texte\fR 
.LP
	\fIS | \fR \ \fIs\*'ibolo de ampliaci\*'on de texto\fR 
.PP
A \fItext extension symbol\fR is a container of text which belongs to the 
\fIgraphical symbol\fR to which the \fItext extension symbol\fR is attached. 
The 
text in the \fItext extension symbol\fR follows the text in the symbol to which
it is attached. [2.2.7]
.RT
.sp 1P
.LP
\fR 	\fBtime\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fItemps (time)\fR 
.LP
	\fIS | \fR \ \fItiempo; time\fR 
.PP
\fITime\fR is a \fIsort\fR defined in a predefined \fIpartial type\fR 
\fIdefinition\fR for which the \fIvalues\fR are denoted as the \fIvalues\fR 
of \fIreal\fR . The predefined \fIoperators\fR using \fItime\fR and \fIduration\fR 
are\ +\ and\(em. 
[5.5.4.1, 5.6.12]
.RT
.sp 1P
.LP
	\fBtimer\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fItemporisateur\fR 
.LP
	\fIS | \fR \ \fItemporizador\fR 
.PP
A \fItimer\fR is an object, owned by a \fIprocess instance\fR , that can 
be \fIactive\fR or \fIinactive\fR . An \fIactive timer\fR returns a \fItimer 
signal\fR to the 
owning \fIprocess instance\fR at a specified time. See also \fIset\fR and 
\fIreset\fR . 
[2.8, 5.5.4.5]
.bp
.RT
.sp 1P
.LP
\fR 	\fBtransition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fItransition\fR 
.LP
	\fIS | \fR \ \fItransici\*'on\fR 
.PP
A \fItransition\fR is an active sequence which occurs when a \fIprocess\fR 
\fIinstance\fR changes from one \fIstate\fR to another. [2.6.7.1] 
.RT
.sp 1P
.LP
	\fBtransition area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de transition\fR 
.LP
	\fIS | \fR \ \fI\*`area de transici\*'on\fR 
.PP
A \fItransition area\fR is the \fISDL/GR\fR representation of a
\fItransition\fR . [2.6.7.1]
.RT
.sp 1P
.LP
	\fBtransition string\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIcha\* | ne de transition\fR 
.LP
	\fIS | \fR \ \fIcadena de transici\*'on\fR 
.PP
A \fItransition string\fR is a sequence of zero or more \fIactions\fR .
[2.6.7.1]
.RT
.sp 1P
.LP
	\fBtransition string area\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIzone de cha\* | ne de transition\fR 
.LP
	\fIF | \fR \ \fI\*'area de cadena de transici\*'on\fR 
.PP
A \fItransition string area\fR is the \fISDL/GR\fR representation of a
\fItransition string\fR . [2.6.7.1]
.RT
.sp 1P
.LP
	\fBtype\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fItype\fR 
.LP
	\fIS | \fR \ \fItipo\fR 
.PP
A \fItype\fR is a set of properties for entities. Examples of classes of 
\fItypes\fR in \fISDL\fR include \fIblocks, channels, signal routes, signals\fR 
, and 
\fIsystems\fR . [1.3.1]
.RT
.sp 1P
.LP
	\fBtype definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de type\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de tipo\fR 
.PP
A \fItype definition\fR defines the properties of a \fItype\fR 
[1.3.1]
.RT
.sp 1P
.LP
	\fBundefined\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIind\*'efini (undefined)\fR 
.LP
	\fIS | \fR \ \fIindefinido\fR 
.PP
\fIUndefined\fR is a \*Qspecial\*U \fIvalue\fR of every \fIsort\fR which 
indicates that a \fIvariable\fR of that \fIsort\fR has not yet been \fIassigned\fR 
a normal \fIvalue\fR . See \fIaccess\fR . [5.5.2.2] 
.RT
.sp 1P
.LP
	\fBvalid input signal set\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIensemble de signaux d'entr\*'ee valides\fR 
.LP
	\fIS | \fR \ \fIconjunto de se\o"n~"ales de entrada v\*'alidas\fR 
.PP
The \fIvalid input signal set\fR of a \fIprocess\fR is the list of all
external \fIsignals\fR handled by any \fIinput\fR in the \fIprocess\fR 
. It consists of 
those \fIsignals\fR in \fIsignal routes\fR leading to the \fIprocess\fR 
. Compare with 
\fIcomplete valid input signal set\fR . [2.4.4, 2.5.2]
.bp
.RT
.LP
\fR 
.sp 1P
.LP
	\fBvalid specification\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIsp\*'ecification valide\fR 
.LP
	\fIS | \fR \ \fIespecificaci\*'on v\*'alida\fR 
.PP
A \fIvalid specification\fR is a \fIspecification\fR which follows the
\fIconcrete syntax\fR and static \fIwell\(hyformedness rules\fR . 1.3.3]
.RT
.sp 1P
.LP
	\fBvalue\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIvaleur\fR 
.LP
	\fIS | \fR \ \fIvalor\fR 
.PP
A \fIvalue\fR of a \fIsort\fR is one of the values which are associated
with a \fIvariable\fR of that \fIsort\fR , and which can be used with an 
\fIoperator\fR 
requiring a \fIvalue\fR of that \fIsort\fR . A \fIvalue\fR is the result of the
interpretation of an \fIexpression\fR . [2.3.3, 5.1.3]
.RT
.sp 1P
.LP
	\fBvariable\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIvariable\fR 
.LP
	\fIS | \fR \ \fIvariable\fR 
.PP
A \fIvariable\fR is an entity owned by a \fIprocess instance\fR or
\fIprocedure instance\fR which can be associated with a \fIvalue\fR through an
\fIassignment statement\fR . When \fIaccessed\fR , a \fIvariable\fR yields 
the last \fIvalue\fR which was assigned to it. [2.3.2] 
.RT
.sp 1P
.LP
	\fBvariable definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de variable\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de variable\fR 
.PP
A \fIvariable definition\fR is the indication that the \fIvariable\fR 
\fInames\fR listed will be \fIvisible\fR in the \fIprocess, procedure\fR 
or \fIservice\fR 
containing the definition. [2.6.1.1]
.RT
.sp 1P
.LP
	\fBview definition\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fId\*'efinition de visibilit\*'e\fR 
.LP
	\fIS | \fR \ \fIdefinici\*'on de visi\*'on\fR 
.PP
A \fIview definition\fR defines a \fIvariable identifier\fR in another
\fIprocess\fR where it has the \fIrevealed attribute\fR . This allows the 
viewing 
\fIprocess\fR to \fIaccess\fR the \fIvalue\fR of that \fIvariable\fR .
[2.6.1.2]
.RT
.sp 1P
.LP
	\fBview expression\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIexpression de vue\fR 
.LP
	\fIS | \fR \ \fIexpresi\*'on de visi\*'on\fR 
.PP
A \fIview expression\fR is used within an \fIexpression\fR to yield the
current \fIvalue\fR of a \fIviewed variable\fR . [5.5.4.4]
.RT
.sp 1P
.LP
	\fBvisibility\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIvisibilit\*'e\fR 
.LP
	\fIS | \fR \ \fIvisibilidad\fR 
.PP
The \fIvisibility\fR of an \fIidentifier\fR is the \fIscope units\fR in 
which it may be used. No two definitions in the same \fIscope unit\fR and 
belonging to 
the same \fIentity class\fR may have the same \fIname\fR . [2.2.2]
.RT
.sp 1P
.LP
	\fBwell\(hyformedness rules\fR 
.sp 9p
.RT
.LP
	\fIF | \fR \ \fIr\*`egles de bonne formation\fR 
.LP
	\fIS | \fR \ \fIreglas de formaci\*'on correcta\fR 
.PP
\fIWell\(hyformedness rules\fR are constraints on a \fIconcrete syntax\fR 
enforcing static conditions not directly expressed by the syntax rules.
[1.4.1, 1.4.2]
.RT
.LP
.bp
.sp 1P
.ce 1000
(Folios anglais par Montage)
.ce 0
.sp 1P
.ce 1000
.sp 1
\fBPour Montage \ \ \ \ 
Fascicule X.1\ \(em\ Dossier 360 \ \ \ \ 
(Anglais) 
.ce 0
.sp 1P
.ce 1000
\fB(FOLIOS 205 \(em 235: AVEC TEXTE SAISI MEP) FOLIOS 236 \(em 265 EXTERIEUR\fR 
.ce 0
.sp 1P
.LP
.sp 3
236
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ B\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ B\fR 237
.ad b
.RT
.LP
.sp 2
238
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ B\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ B\fR 239
.ad b
.RT
.LP
.sp 2
240
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ B\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ B\fR 241
.ad b
.RT
.LP
.sp 2
242
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ B\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ B\fR 243
.ad b
.RT
.LP
.sp 2
244
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ B\fR 
.LP
.bp
.ad r
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 245
.ad b
.RT
.LP
.sp 2
246
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 247
.ad b
.RT
.LP
.sp 2
248
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 249
.ad b
.RT
.LP
.sp 2
250
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 251
.ad b
.RT
.LP
.sp 2
252
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 253
.ad b
.RT
.LP
.sp 2
254
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 255
.ad b
.RT
.LP
.sp 2
256
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 
.LP
.sp 2
.ad r
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 257
.ad b
.RT
.LP
.sp 2
258
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 259
.ad b
.RT
.LP
.sp 2
260
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 261
.ad b
.RT
.LP
.sp 2
262
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 263
.ad b
.RT
.LP
.sp 2
264
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 
.ad r
.sp 2
\fBFascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ C1\fR 265
.ad b
.RT
.LP
.bp