ГОСТ Р НСО/МЭК то 10023-М
—>
Bool
Bool
Bool
.IsTopOL
IsEmpty
TSP. TreqHistory
— >
TreqHistory
_eq., -ne_
TReqHistory. TReqHistory
— >
eqns
forall,
t. tl : TSP. h. hi : TRcqHistory
ofsort TRcqHistory
IsTlnd(t) = >t OnTopOf h=h;
ofsort Bool
IsEmpty (NoTReqs) =truc;
IsTReqit) = > IsEmpty(t OnTopOf h) = false;
NoTRe<fs eq NoTreqs= truc;
IsTReq(t) - > NoTReqs eq (t OnTopOf h) = false;
IsTReq(t) - > t OnTopOf h eq NoTReqs-falser
~ >КГ OnTopofh^q^ttl OnTopOf hi) = (t eq tl) and (h eq hi);
h ne hi = not(h eq hi);
t lsTopOfNoTReqs=false;
IsTReq(t) » > t OnTopOf (tl OnTopOf hi) —t eq| tl;
endtype (* TransportServiceBasicTSPRequestHistory )
type TransportServiceTSPRequestHistory
is TransportServiceBasicTSPRequcstHistory
Reduce
Remove
Append
opns
TReqHistory
TSP, TReqHistory
TSP. TReqHistory
Tops. TDJSTops. TEXDlSTops
TReqHistory
— > TReqHistorv
—> TRcqHistorv
—> TRcqHistory
—> TRcqHistory
cqns
-----
-
forall
t, tl : TSP. h. hi ; TreqHistory.. . .
ofsort TReqHistory■
Reduce (NoTReqs) = NoTReqs:
IsTReq(t) = > Reduced OnTopOf h)=h;
Remove(t. NoTReqs) = NoTReqs;
t eq tl = > Remove(t. tl OnTopOf hi) = h;
t ne tl - > Remove(t. tl OnTopOf hi) —tl OnTopOf Removed, hi);
Append(t. NoTReqs) = t OnTopOf NoTReqs;
IsTReq(tl) = > Append(t. tl OnTopOf hl )=tl OnTopOf Append(„
hi);
Tons (NoTReqs) = NoTReqs:
I$TReq(t). IsTDISd) - > Tops(t OnTopOf h)«=t OnTopOf
«I