STM Ot

Asecto
slate gyab und toition Testing
badector/Refait state gaah
he behawiouy of the systen is sepseen
fend sectoyap
Sectov/RepatBady td in goaphica! fzom which is known as
'state Graph
Sectos) o d sector/Nb Te state gouph is used fos-fnctonel tstig
GP tue system to identit df bugs
6 To idetity te state bugs ¢
bad
bod sectorosat Tansiton Bugs
states
damage Inpts
Tsanitong
State gph fox tad Dsk Recoker Staty'A statein astategouph is te
node ohicn epieets the charattehitics
&behaviou oP te system. State gooaph hes
set of states ond tey Oe idetikd by
Charactes of nubesg.
Ingut The State in re state g9oph
Cortains input Values to gepsesent the
Changes to the stotey They an be deno fed by
 numbes oP ChonactOrs
Tovsi tions'- The bnk -that joing two
Statey is known as Tansition Wn
Sone input is appl'ed tothe
node,
tre state Chanses &the pzoce4s o chan
ging of state is troun Os Tsangition'
Ostputs ter procesing an input
sutt i produced whith is krown a
oput The input and gutpt ot the
Stote quph ae sep Auted by Slash
State Gaph

The states e input s 4 tansitons in te stit

guph Can be erpbined o,
S Stat Gtecte
a’ Enter pin mbes
( ’ Veihin fpin numbe.
c pin nemben is
3’erte pin Wrong.
b 7 Pin numh S oK
2S6een dispays to opbans
eiyi mone Othdowal
balane
 ott balonce eneluiy" is Chosscn
Pint seceit
A'ony withdsausal' is Choasen
-Erte amout
amout is ertered.
eeeived morey
Keeeit is poirtad
fote stote achire
malhine is a nadel ot Compu
Finite state sets,astat
Consisting oP a set ol
Haton
stute, an input
-tat maps pt symlos Aaarent
fenchion
taty to net state
modl a laage numbes ofpte
FSM's Can
as0 Desiçh Aitomtion
ms Such
et

State Teble Stateqoraph n tne.

The sepseyetction of
krown as tate Table
foón of tale is be die
because it woud
This is done nodey of
-alt task to go though al the
the state g9ap
 Pthe qraph is Cowted into ta,
t would be mgve Conyeniot
Tre state tale is ao kron as gat
togrtion table. tote
The-table Cortais os lsumns to
Store infosnation.
Inputs Good sectoY
Statey Bad sectoy
S/Nof
S(NGP P/sepai
Q/epais
S/Nop R/7epar
R s/Nof
Fldsmaye
(2
State hble fos Goaph
Tine Ns ruence
Sevonce
state gaph don't-7 State goraph epseet e
depdesert Time Sevence
Atsgition miatA Systen Could be in o
taes micsASLlond s State r mlliseonds
anotren fos eony
Can beblobo tated -to
incade Inotations ot bne
in addition -to

he state praph is zepregentaton of

hvios Of overall system gupiially
Pt Fepsesents each and evey state,
ponyithonOutput of the system
bThe SoPtae Smlenextetion of test
en State gaph Con be lrdeytod in

OImplemantato n oputon:
0Snput ontding
9Otput tndcoding
OStateCodes State symbol poduct s.
DAppiatii Cormunts fo designhs
Arpltion (omment for tetes.
Theu cauld be disect selaton blw te
Po4ams and behaious o a poces
gpmetine Which is descaibed as State
O Enading is te procest >stote tade hoy mno se wes in Grimunioti
(orwenting
the Chaacters in to numboeakg.
npt encodiry is the Pioess ot yhis teh Gn povide fast epone ting.
Corsenting the given apets OAis not Corsidened by indarpendant
These eists many kinds of testes
output:
fos diifrznt tsonsitiorg in finte (hey Conertsante on seprestt of state
stote mochine qoph os stetetable.
The Otputs Gn be
9 Te tutes wod be concened onyit
Single Chaacter, stoiry ot chaactess,
Cal a subroutines, Contool tenfos
(4The States in the stateachine are t helps in designig the-test lase
Corsided as it they 09e
ore nemmbered by Rectively
Cnd both stat s o and if statt d Te state guph ahiCh Can be goo
input cad crse s d i dspectiely. whilh folows a, paindples ae Rruon as
7Thun te pointes Volue wsuld be Ghood stote grapl. hey
Spti (os) iNtS. The numbes of Stotg in the stateq9ngh
9The implemntation ot state tabla ha must be same ay the poduct ot possbe
on oauantases in bsth the slases. ne tactos.
7hen Contsol tey may Chonseif for every uniaue Cambnation ot yte &
’ Aben device hos most Simnilkg bt fotodino¢.tL should. be One tanstion
diheest Contsolfun ctions Pew Specitied.
 ’Evehytoayition, Should lbeai Senci
Output
Bod stete qapbs cannat be
The state goaphs Which

are knswn s'Bod stote graphs". They ae

Sorme Casey to slouw the bad Stote qrag.
ab

There is no ptn. Hw them.

b

In put b' is seceived at State 2' the

Patn is undond.
a

Gosd state goaphtan) Bad state graph-a

are cusy Speaied .easyt then try ae said tobe

BS G.
n tis, eay State sheuldîn this,e saut oPind.
hove a seunle o input ti doesn'k ladto te i
ivy teSysttm tthe State
Stains atat
2Inthis, be ony o tontion More than onttostonss
Pctiedfosane statt &
ienSpeitied fot Cucy Stt
ration ile Gnbinatn
 |they ae ditiat to-fin.
Kis ony one out putnthis ,one
o6mose tha

State

Mie sesorn tos whioh state bugs aoa die

ATe ONumbes aPstaty
OImpsibe strtes
Eauialent states
uben of stotes'
he nunbes of States in tre gate fap
(an be Coridered the numbr of Staty
ut ane qised to dentify te behaioy
oP the System.
Every state of tie gaph is vey inp ta
te the state testing
essertial to find tre number
So it is
cP states
the treye tind af
n findig
tis,by tiabses
numbetstates is kas stute buys -
 The number of Sttey lanbe dert
by >Fnding al foctoos aP te state
’Finding al the possible Values 2
each factax.
Lnpsible statesi
’These Cun be some (ormbination1 op fare
-s that nay appes to be
mpansibe T4
trese taetorS ase incdedd they lead to
impossible Stotey
The irmpessible statey do nott hwe any
meoning in the system teimpossibe
stoes are the one which aTet passibe to
Cecs.
piiection
Gea
R,N,.2,3,t5
Engine
opeotion Running stofped
Engie good, faautty =2|
Condition
Total 84 staty
a a tStates:
every SeAuence ot inputs om one
te gertey enactly the Sane seuane
state

out Puts oP otres states, thn both the

tes ahe Said to be eaivalet statey.
ahn botn te states podue same outra
yans only one state would be enauyh
isttad o tws strtes.
Rutin
2
Routi

(Foutin.
3

Equivalsnt states
ation bugs- The tansition an te Cauga
dule to Unspecifued 4Contaci ctoxy tonst
’Unseachasle Sttes;’ Dad statey

tox eve state in pet Combinbtion,tree

should be a toansition specttied.
It tre tsonsitony ahe not spcified
then tre bugs can ocw Cul to tanspet
-ied trarsition bls te Yttey
 UnseAzhabe stots
D there is Some stote which inpu
no
Sevence Can seach tren that Stare
Known as "Unseachetde state". fo ti
tore ae jncoset torstong.
Dead states
is such astate that ie
Dead stete
enteed once, that state Cannst be
is
lety. (Dead state is pothirg but deod)
desd
a

Deod steute gsaph

e outpt of the toANitong Could be iha
-9 even f all the states,thes
tsaryeaito
& inputs ate Codsetd tnee reno dead
0 neachable Stoes
The Yeayon fox the wesong output ou
be in Costect (all to ne douthne tet shou
be eneCcuttd foo output iThis iS a mieno
bug
Eocading bug- The poes of Cometrtingo
Coding the inpusrt6ay itiory QOutput
of the sttesin odor to Obhfain re seuee
pscess ot fnite state Machire is
knouy
s endiaing and it is essential poocess.
Encoding is done botr in eaglkcts inpbat

4State teyting is delined. afunci

-onal testing telhiajue to teyt the
Pen tiona bues in tne entise ystem
1he pináples fos state tesis Ge
Ves simiaà to the pinciples fos pats
teting
Fos pathtesting it is not possible to
test evy possibe path ina ogo
Sim by state seting, not possible to
vey ossible path in stote sap
Advartoges
State tyting is gnglud when tve ciro
Cssection s ahe les edpensive.
’tate testing is also yefll ohenthe
testens wat to deteot a Specfed
inpt
AState tesiny pvidey the biggest sala
-ds ding te design ot te teing
 Dised1atrses re not appied. Tt Woud be easy to otehbss
’Sttetetiy cgnt prnide
tesing beteuye thena test tisongugh
is Gonsiderud os bottom line
mettad yit Suppo ts-futonal
Canpotea ythen modl
mi_lt be some bugs denained in
taste migt than te Stauchaa! details.
System
Saitenes, Fla3s Omd nachieable pat
he suitches and flass cre most esfetil
taty,etá Sttes te ink. fools or teting the ste greph
hey are yed totest the fnit sate
’The bs in ter software anOethaa pnachire in wey Possible stte
-h many ditferetases. Pnte eaay stages oE fnite state edin
De to-theye bus itisimposibe oves t, afby is inatialeed and dependiny
all te paths i tetate On trs value aspectc poth cs
buys mayaa de to, qaph the to find the easiest pathbr Selected
Incost numbes of ate 2E uy ijony finite
it State mochin teyting te M

Tnoset Stat tangttunsinenet

A
M

ncoeet toarsition Output Ce)

(B)
State Prgam oith one floy. A,A =Fays
Unsethasle sttey. M

The occutene of bus w be mose iy N (o)Tonsitioy

Datalink
KLM
tonsy aneted graph B

DWhn thesuten has no stote and whentn NLM

uimpsoPeAsystSA deponses,te state diao

 Esential and Tnesetia)-finite sta
Esentisl AirsM malivne ts paey
Ackrouladsenot and has no spectu bic
PEven decis iorn toble o tee (s Unabeta !
Cosity its behavia Unotik clonledsany
IS Stooed in a toble.
’The onby poblem Wrth the ÉFMB Machine
tuat it pro vides lots Gf wosk iicyt
fox te sake o byanh
State myt be tested testing iseley
whih not
mandaty or esetlal
* The follouwing are the Conditiony at
nessentialfinite
Condition 092
state behauloua i-tu!
not satisted then tre
w opfy FSM is belolg
koown y Eserial.
in dota PlowGon be obtangd by Paralel pog
sf behoviou machine.
is obtainedfrom dedlsiont
Os decisiontöee.

dapogaan inchadirg laps

unde te lopirg Conditong.
 DesinGuide ines os Budinyfnite M.
tow toimplentrtatio n ot FsM dane bsts
in softae and handae
Stast the desi_niy ard chetck ie for
the Reawisemerct
CGnsy out te analysis in te fosm of
a State qupb Ox state tole with thee
me sttey.
DeSisn te stote machire erplotyiesles

corstgct a hierarchi cal desie.

Use shost ts tp (omplete the
de sign pooceg