timeout StoR!msg0 RtoS?ack0
|
|
- Gwenda Murphy
- 8 years ago
- Views:
Transcription
1 c1997kluweracademicpublishers,boston.manufacturedinthenetherlands. FormalMethodsinSystemDesign,,?{??(1997) SymbolicVericationofCommunication ProtocolswithInniteStateSpacesusingQDDs queues.itiswell-knownthatmostinterestingvericationproblems,suchasdeadlockdetection, nitesetofnite-statemachinesthatcommunicatebyexchangingmessagesviaunboundedfifo BERNARDBOIGELOT*ANDPATRICEGODEFROID** verywellturnouttobedecidableforasubclasscontainingmost\real"protocols. areundecidableforthisclassofsystems.however,inpractice,thesevericationproblemsmay Abstract.Westudythevericationofpropertiesofcommunicationprotocolsmodeledbya oftheprotocolbeinganalyzed.aloop-rstsearchisasearchtechniquethatattemptstoexplore evenifthisstatespaceisinnite.ouralgorithmperformsaloop-rstsearchinthestatespace structurenamedqueue-contentdecisiondiagram(qdd)isintroducedforrepresenting(possibly mayconstructaniteandexactrepresentationofthestatespaceofacommunicationprotocol, rsttheresultsofsuccessiveexecutionsofloopsintheprotocoldescription(code).anewdata Motivatedbythisoptimistic(and,weclaim,realistic)observation,wepresentanalgorithmthat presented. cationprotocolswithinnitestatespaceshavebeenperformed.fortheseexamples,ourtool innite)setsofqueue-contents.operationsformanipulatingqddsduringaloop-rstsearchare 1.Introduction completeditssearch,andproducedanitesymbolicrepresentationfortheseinnitestatespaces. Aloop-rstsearchusingQDDshasbeenimplemented,andexperimentsonseveralcommuni- ofallstatesencounteredduringtheexploration,startingfromagiveninitialstate, State-spaceexplorationisoneofthemostsuccessfulstrategiesforanalyzingand ploringaglobalstategraphrepresentingthecombinedbehaviorofallconcurrent byexecutingallenabledtransitionsineachstate.thestategraphthatisexplored componentsinthesystem.thisisdonebyrecursivelyexploringallsuccessorstates verifyingpropertiesofnite-stateconcurrentreactivesystems.itproceedsbyextemcanbecheckedbyexploringitsstatespace:deadlocks,deadcode,violations iscalledthestatespaceofthesystem.manydierenttypesofpropertiesofasys- ofuser-speciedassertions,etc.moreover,therangeofpropertiesthatstate-space decadethankstothedevelopmentofmodel-checkingmethodsforvarioustemporal logics(e.g.,[9,19,22,27]). (cf.[17,23]).thesimplicityofthestrategylendsitselftoeasy,andthusecient, explorationtechniquescanverifyhasbeensubstantiallybroadenedduringthelast implementations.moreover,vericationbystate-spaceexplorationisfullyautomatic:nointerventionofthedesignerisrequired.themainlimitofstate-space Vericationbystate-spaceexplorationhasbeenstudiedbymanyresearchers *\Aspirant"(ResearchAssistant)fortheNationalFundforScienticResearch(Belgium).The workofthisauthorwasdoneinpartwhilevisitingbelllaboratories. **LucentTechnologies{BellLaboratories,1000E.WarrenvilleRoad,Naperville,IL60566,
2 2explorationvericationtechniquesistheoftenexcessivesizeofthestatespace. Obviously,thisstate-explosionproblemisevenmorecriticalwhenthestatespace beingexploredisinnite. queues.wepresentastate-spaceexplorationalgorithmforconstructinganiteand statemachinesthatcommunicatebyexchangingmessagesviaunboundedfifo Specically,weconsidercommunicationprotocolsmodeledbyanitesetofnite- bystate-spaceexplorationisalsopossibleforsystemswithinnitestatespaces. Incontrastwiththelastobservation,weshowinthispaperthatverication toverifymanypropertiesoftheprotocol,suchastheabsenceofdeadlocks,whether statespaceisinnite.fromthissymbolicrepresentation,itisthenstraightforward ornotthenumberofmessagesstoredinaqueueisbounded,andthereachability exactrepresentationofthestatespaceofsuchacommunicationprotocol,evenifits Indeed,itiswell-knownthatunboundedqueuescanbeusedtosimulatethetape oflocalandglobalstates. undecidableforthisclassofsystems[8].however,inpractice,theseverication ofaturingmachine,andhencethatmostinterestingvericationproblemsare problemsmayverywellturnouttobedecidableforasubclasscontainingmost Ofcourse,givenanarbitraryprotocol,ouralgorithmmaynotterminateitssearch. introducedinthispaper. tocolswithinnitestatespaceshavebeenveriedsuccessfullywiththealgorithm \real"protocols.tosupportthisclaim,propertiesofseveralcommunicationpro- ofsuccessiveexecutionsofloopsintheprotocoldescription(code).thissearch performsaloop-rstsearchinthestatespaceoftheprotocolbeinganalyzed.a techniqueispresentedinsection3.anewdatastructure,thequeue-content loop-rstsearchisasearchtechniquethatattemptstoexplorersttheresults Inthenextsection,weformallydenecommunicationprotocols.Ouralgorithm innite)setsofqueue-contents.operationsformanipulatingqddsduringaloop- rstsearcharepresentedinsection5.aloop-rstsearchusingqddshasbeen DecisionDiagram(QDD),isintroducedinSection4forrepresenting(possibly implemented,andexperimentsonseveralcommunicationprotocolswithinnite statespacesarereportedinsection6.thispaperendswithacomparisonbetween ourcontributionsandrelatedwork. municatewitheachotherbysendingandreceivingmessagesviaanitesetqof 2.CommunicatingFinite-StateMachines ConsideraprotocolmodeledbyanitesetMofnite-statemachinesthatcom- unboundedfifoqueues,modelingcommunicationchannels.letmidenotethe nitesetofstatesofmachinemi,1ijmj. setofmessagesthatcanbestoredinqueueqi,1ijqj.fornotationalconvenience,letusassumethatthesetsmiarepairwisedisjoint.letcidenotethe messages,andtisanitesetoftransitions,eachofwhichisatripleoftheform actions,qisanitesetofunboundedfifoqueues,m=[jqj isanitesetofcontrolstates,c02cisaninitialcontrolstate,aisanitesetof Formally,aprotocolPisatuple(C;c0;A;Q;M;T)whereC=C1CjMj i=1miisanitesetof
3 qi!w,whereqi2qandw2mi,qi?w,whereqi2qandw2mi,ora,where (c1;op;c2)wherec1andc2arecontrolstates,andopisalabelofoneoftheforms 3 Atransitionoftheform(c1;qi?w;c2)representsachangeofthecontrolstatefrom fromc1toc2whileappendingthemessagescomposingwtotheendofqueueqi. c1toc2whileremovingthemessagescomposingwfromtheheadofqueueqi. a2a. Aglobalstateofaprotocoliscomposedofacontrolstateandaqueue-content. Atransitionoftheform(c1;qi!w;c2)representsachangeofthecontrolstate CjMjM1MjQj.Aglobalstate=(c(1);c(2);:::;c(jMj);w(1);w(2); Formally,aglobalstate,orsimplyastate,ofaprotocolisanelementofthesetC1 Aqueue-contentassociateswitheachqueueqiasequenceofmessagesfromMi. Ci,andassociateswitheachqueueqjasequenceofmessagesw(j)2Mjwhich systemis0=(c0(1);c0(2);:::;c0(jmj);";:::;"),i.e.,weassumethatallqueues areinitiallyempty. representsthecontentofqjintheglobalstate.theinitialglobalstateofthe :::;w(jqj))assignstoeachnite-statemachinemia\local"(control)statec(i)2 globalstates,anda2a[fg.leta!0denote(;a;0)2!.relation!is if(c1;qi!w;c2)2t,then(c1(1);c1(2);:::;c1(jmj);w0(1);w0(2);:::;w0(jqj))! denedasfollows: Aglobaltransitionrelation!isasetoftriples(;a;0),whereand0are if(c1;qi?w;c2)2t,then(c1(1);c1(2);:::;c1(jmj);w0(1);w0(2);:::;w0(jqj))! totheendofqueueqi); (c2(1);c2(2);:::;c2(jmj);w00(1);w00(2);:::;w00(jqj))wherew00(i)=w0(i)wand (c2(1);c2(2);:::;c2(jmj);w00(1);w00(2);:::;w00(jqj))wherew0(i)=ww00(i)and w00(j)=w0(j);j6=i(thecontrolstatechangesfromc1toc2andwisappended if(c1;a;c2)2t,then(c1(1);c1(2);:::;c1(jmj);w0(1);w0(2);:::;w0(jqj))a! (c2(1);c2(2);:::;c2(jmj);w00(1);w00(2);:::;w00(jqj))withw00(i)=w0(i),forall fromtheheadofqueueqi); w00(j)=w0(j);j6=i(thecontrolstatechangesfromc1toc2andwisremoved asequenceofglobaltransitions(i 1;ai;i),1in,suchthat=0a1 Aglobalstate0issaidtobereachablefromanotherglobalstateifthereexists 1ijQj(thecontrolstatechangesfromc1toc2whiletheactionais performed). setofallstatesthatarereachablefromtheinitialglobalstate0. Example:Asanexampleofcommunicationprotocol,considerthewell-known 1n 1an!n=0.Theglobalstatespaceofasystemisthe(possiblyinnite)! Alternating-BitProtocol[6].Thisprotocolcanbemodeledbytwonite-state T)whereC=CSenderCReceiver,whereCSender=f1;2;3;4;5;6;7;8;9;10g totransmitacknowledgmentsfromthereceivertothesender). StoR(usedtotransmitmessagesfromtheSendertotheReceiver)andRtoS(used machinessenderandreceiverthatcommunicateviatwounboundedfifoqueues Precisely,theAlternating-BitProtocolismodeledbytheprotocol(C;c0;A;Q;M;
4 RtoS?ack0 RtoS?ack1 StoR!msg0 timeout StoR!msg0 Snd StoR!msg1 Snd StoR!msg0 RtoS?ack1 StoR!msg1 RtoS?ack0 timeout StoR!msg1 StoR?msg0 StoR?msg1 RtoS!ack1 RtoS!ack0 Rcv Rcv StoR?msg1 RtoS!ack1 StoR?msg0 RtoS!ack0 SENDER RECEIVER Figure1.Alternating-BitProtocol andcreceiver=f1;2;3;4;5;6;7;8g;c0=(1;1);a=fsnd;rcv;timeoutg;q= fstor;rtosg;m=mstor[mrtos,wheremstor=fmsg0;msg1gandmrtos= fack0;ack1g;andtcontainsthetransitions((s1;r1);op;(s2;r2))whereeitherr1= r2and(s1;op;s2)isatransitioninthesendermachineoffigure1,ors1=s2and (r1;op;r2)isatransitioninthereceivermachineoffigure1.theactionsndmodelsarequesttothesender,comingfromahigher-levelapplication,totransmitdata tothereceiverside.theactualdatathataretransmittedarenotmodeled,only messagenumbersmsg0andmsg1aretransmittedoverthequeues.similarly,the actionrcvmodelsthetransmissionofdatareceivedbythereceivertoahigher-level application.theactionslabeledbytimeoutmodeltheexpirationoftimeouts. 3.Loop-FirstSearch Allstate-spaceexplorationtechniquesarebasedonacommonprinciple:they spreadthereachabilityinformationalongthetransitionsofthesystemtobeanalyzed.theexplorationprocessstartswiththeinitialglobalstateofthesystem,and triesateverysteptoenlargeitscurrentsetofreachablestatesbypropagatingthese statesthroughtransitions.theprocessterminateswhenastablesetisreached. Inordertousetheabovestate-spaceexplorationparadigmforverifyingproperties ofsystemswithinnitestatespaces,twobasicproblemsneedtobesolved:one needsarepresentationforinnitesetsofstates,aswellasasearchtechniquethat canexploreaninnitenumberofstatesinaniteamountoftime.
5 previoussection,oursolutiontotherstproblemistorepresentthecontrolpart Inthecontextofthevericationofcommunicationprotocolsasdenedinthe 5 datastructuresforrepresenting(possiblyinnite)setsofqueue-contentsassociated explicitlyandthequeue-contents\symbolically".specically,wewillusespecial withreachablecontrolstates. exploring(possiblyinnite)setsofglobalstatesratherthanindividualglobalstates. ofreachablestatesfromasinglereachablestate,meta-transitions[7]canbeused. Thismaymakeitpossibletoreachastablerepresentationofthesetofreachable globalstates,evenifthissetisinnite.inordertosimultaneouslygeneratesets Tosolvethesecondproblem,wewillusethesedatastructuresforsimultaneously globalstateshavethesamecontrolstatec. Givenaloopthatappearsintheprotocoldescriptionandacontrolstatecinthat reachedafterrepeatedexecutionsofthebodyoftheloop.bydenition,allthese loop,ameta-transitionisatransitionthatgeneratesallglobalstatesthatcanbe insuchawaythatitworkswithsetsofglobalstates,i.e.,pairsoftheformhcontrol state,datastructurei,ratherthanwithindividualstates.initially,thesearch transitionsareexecutable,theyareexploredrst,whichisaheuristicaimedat startsfromaninitialglobalstate.ateachstepduringthesearch,whenevermeta- Theclassicalenumerativestate-spaceexplorationalgorithmcanthenberewritten searchaloop-rstsearch.thesearchterminatesiftherepresentationofthesetof generatingmanyreachablestatesasquicklyaspossible.thisiswhywecallsucha reachablestatesstabilizes.thishappenswhen,foreverycontrolstate,everynew withthatcontrolstate.atthismoment,thenalsetofpairshcontrolstate,data deduciblequeue-contentisincludedinthecurrentsetofqueue-contentsassociated structureforrepresenting(possiblyinnite)setsofqueue-contents,andalgorithms formanipulatingthesedatastructures.specically,wheneveratransitionora structureirepresentsexactlythestatespaceoftheprotocolbeinganalyzed. rstsearch,thenewpairhcontrolstate,datastructureiobtainedaftertheexecution meta-transitionisexecutedfromapairhcontrolstate,datastructureiduringaloop- Inordertoapplythevericationmethoddescribedabove,weneedtodeneadata structure,oneneedstobeabletocomputeanewdatastructurerepresentingthe eectofsendingmessagestoaqueue(qi!w)andreceivingmessagesfromaqueue (qi?w),aswellastheresultofexecutingfrequenttypesofmeta-transitions,such ofthis(meta-)transitionhastobedetermined.therefore,fromanygivensuchdata asrepeatedlysendingmessagesonaqueue((qi!w)),repeatedlyreceivingmessages fromaqueue((qi?w)),andrepeatedlyreceivingthesequenceofmessagesw1from aqueueqifollowedbysendinganothersequenceofmessagesw2onanotherqueue qj,i6=j,((qi?w1;qj!w2)).finally,basicoperationsonsetsarealsoneeded,such ascheckingifasetofqueue-contentsisincludedinanotherset,andcomputingthe unionoftwosetsofqueue-contents. Queue-contentDecisionDiagrams(QDDs)aredatastructuresthatsatisfyallthe 4.Queue-contentDecisionDiagrams constraintslistedintheprevioussection.aqddisaspecialtypeofnite-state
6 6automatononnitewords.Anite-stateautomatononnitewordsisatuple A=(;S;;s0;F),whereisanalphabet(nitesetofsymbols),Sisaniteset s02sistheinitialstate,andfsisasetofacceptingstates.atransition symbolsinisacceptedbytheautomatonaifthereexistsasequenceofstates (s;a;s0)issaidtobelabeledbya.anitesequence(word)w=a1a2:::anof ofstates,s([f"g)sisatransitionrelation("denotestheemptyword), =s0:::snsuchthat81in:(si 1;ai;si)2,andsn2F.Thesetof wordsacceptedbyaiscalledthelanguageacceptedbya,andisdenotedbyl(a). obtainedbyremovingallsymbolsinwthatarenotinmi.anautomatonissaid LetusdenetheprojectionwjMiofawordwonasetMiasthesubsequenceofw tobedeterministicifitdoesnotcontainanytransitionlabeledbytheemptyword, (M;S;;s0;F)onnitewordssuchthat Denition1.AQDDAforaprotocolPisadeterministicnite-stateautomaton andifforeachstate,alltheoutgoingtransitionsarelabeledbydierentsymbols. Precisely,QDDsaredenedasfollows. andrepresentsasetofpossiblequeue-contentsforthiscontrolstate.eachword AQDDisassociatedwitheachcontrolstatereachedduringaloop-rstsearch, 8w2L(A):w=wjM1wjM2:::wjMn: protocol. wacceptedbyaqdddenesonequeue-contentwjmiforeachqueueqiinthe representedbyoneuniqueword.inotherwords,denition1implicitlydenesa bymessagesinmialwaysappearbeforetransitionslabeledbymessagesinmjif i<j.therefore,forallqddsforaprotocol,agivenqueue-contentcanonlybe qiintheprotocolsuchthat,forallqddsforthisprotocol,transitionslabeled ByDenition1,atotalorder<isimplicitlydenedonthesetQofallqueues \canonical"representationforeachpossiblequeue-content.notethatthisdoesnot implythatqddsarecanonicalrepresentationsforsetsofqueue-contents. anotherqdd,forcomputingtheunionofqdds,etc.(e.g.,see[18]).inwhatfollows,a1[a2willdenoteanautomatonthatacceptsthelanguagel(a1)[l(a2), whiledeterminize(a)willdenoteadeterministicautomatonthatacceptsthe ingifthelanguageacceptedbyaqddisincludedinthelanguageacceptedby Standardalgorithmsonnite-stateautomataonnitewordscanbeusedforcheck- 5.OperationsonQDDs Section3. (si 1;ai;si),1in,suchthatw=a1a2:::an,s0=s,sn=s0,andsi;1i<n, languagel(a).wewillwrite\add(s;w;s0)to"tomeanthattransitions thelanguageacceptedbya,andletlop(a)denotethelanguagethathastobe arenew(fresh)states,areaddedto. LetAbetheQDDassociatedwithagivencontrolstatec.LetL(A)denote WenowdescribehowtoperformtheotherbasicoperationsonQDDslistedin
7 SEND(queueidi,wordw,QDD(M;S;;s0;F))f 7 Forallstatess2Ssuchthat dothefollowingoperations: 9w02([ij=1Mj):s0w0 Foralltransitionst=(s;m;s00)2suchthatm2Mj;j>i: Addanewstates0toS; )s, Add(s;w;s0)to; Ifs2F,adds0toF,andremovesfromF; Foralltransitionst=(s00;m;s)2suchthatm2Mj;j>i: Replacetby(s00;m;s0); Replacetby(s0;m;s00); RECEIVE(queueidi,wordw,QDD(M;S;;s0;F))f ReturnDETERMINIZE((M;S;;s0;F)). gforallstatess2ssuchthat dothefollowingoperations: 9w02([i 1 j=1mj):s0w0 Foralltransitionst=(s;m;s00)2suchthatm2Mj;ji: Addanewstates0toS; )s, Forallstatess002Ssuchthats0w)s00: Foralltransitionst=(s00;m;s)2suchthatm2Mj;ji: Addatransition(s;";s00)to; Replacetby(s00;m;s0); Replacetby(s0;m;s00); ReturnDETERMINIZE((M;S;;s0;F)). gifs2f,adds0tof,andremovesfromf; associatedwiththecontrolstatec0reachedaftertheexecutionofatransition Figure2.qi!wandqi?w (c;op;c0)fromthecontrolstatec,withop2fqi!w;qi?wg.wehavethefollowing: Lqi!w(A)=fw00j9w02L(A):w00jMi=w0jMiw^8j6=i:w00jMj=w0jMjg; obtainedaftertheexecutionofatransitionoftheformqi!worqi?wonaqdd Lqi?w(A)=fw00j9w02L(A):w0jMi=ww00jMi^8j6=i:w00jMj=w0jMjg: AlgorithmsforcomputingaQDDA0thatacceptsallpossiblequeue-contents
8 establishedbythefollowingtwotheorems. 8A=(M;S;;s0;F)aregiveninFigure2.Thecorrectnessofthesealgorithmsis thatl(a0)=lqi!w(a). Proof:SeeAppendix. w,a),andletl(a0)denotethelanguageacceptedbya0.thena0isaqddsuch Theorem1LetAbeaQDD,letA0denotetheautomatonreturnedbySEND(i, thatl(a0)=lqi?w(a). Proof:SeeAppendix. w,a),andletl(a0)denotethelanguageacceptedbya0.thena0isaqddsuch Theorem2LetAbeaQDD,letA0denotetheautomatonreturnedbyRECEIVE(i, operation(qi?w)denotestheunionofallpossiblequeue-contentsobtainedafter sequencesofmessagesw2mitothequeueqiofthesystem,forallk0.the receivingksequencesofmessagesw2mifromthequeueqiofthesystem,for (qi!w)denotestheunionofallpossiblequeue-contentsobtainedaftersendingk Wenowconsiderthemeta-transitionsdiscussedinSection3.Theoperation allk0.theoperation(qi?w1;qj!w2)denotestheunionofallpossiblequeuecontentsobtainedafterreceivingksequencesofmessagesw12mifromthequeue fori6=j. qiandsendingksequencesofmessagesw22mjtothequeueqj,forallk0,and associatedwiththecontrolstatecreachedaftertheexecutionofameta-transition thelanguageacceptedbya,andletlop(a)denotethelanguagethathastobe (c;op;c)withop2f(qi!w);(qi?w);(qi?w1;qj!w2)g.wehavethefollowing: LetAbetheQDDassociatedwithagivencontrolstatec.LetL(A)denote L(qi?w)(A)=fw00j9w02L(A);k0:w0jMi=wkw00jMi^8j6=i:w00jMj= L(qi!w)(A)=fw00j9w02L(A);k0:w00jMi=w0jMiwk^8j6=i:w00jMj= L(qi?w1;qj!w2)(A)=fw00j9w02L(A);k0:w0jMi=wk1w00jMi^w00jMj= w0jmjg; (qi?w1;qj!w2)onaqdda=(m;s;;s0;f)aregiveninfigures3and4.the obtainedaftertheexecutionofameta-transitionoftheform(qi!w),(qi?w),or AlgorithmsforcomputingaQDDA0thatacceptsallpossiblequeue-contents w0jmjwk2^8l62fi;jg:w00jml=w0jmlg: Theorem3LetAbeaQDD,letA0denotetheautomatonreturnedbySEND- correctnessofthesealgorithmsisestablishedbythefollowingtheorems. STAR(i,w,A),andletL(A0)denotethelanguageacceptedbyA0.ThenA0isa QDDsuchthatL(A0)=L(qi!w)(A). Proof:SeeAppendix.
9 SEND-STAR(queueidi,wordw,QDD(M;S;;s0;F))f Forallstatess2Ssuchthat Addtwonewstatess0ands00toS; dothefollowingoperations: 9w02([ij=1Mj):s0w0 Foralltransitionst=(s;m;s000)2suchthatm2Mj;j>i: )s, Ifs2F,adds00toF; Add(s;";s0),(s0;";s00)and(s0;w;s0)to; Foralltransitionst=(s000;m;s)2suchthatm2Mj;j>i: Replacetby(s000;m;s00); Replacetby(s00;m;s000); RECEIVE-STAR(queueidi,wordw,QDD(M;S;;s0;F))f ReturnDETERMINIZE((M;S;;s0;F)). gforallstatess2ssuchthat 9w02([i 1 j=1mj):s0w0 Foralltransitionst=(s;m;s00)2suchthatm2Mj;ji: Addanewstates0toS; dothefollowingoperations: )s, Forallstatess002Ssuchthat9w02fwg:s0w0 Foralltransitionst=(s00;m;s)2suchthatm2Mj;ji: Replacetby(s00;m;s0); Replacetby(s0;m;s00); ReturnDETERMINIZE((M;S;;s0;F)). Ifs2F,adds0toF; Addatransition(s;";s00)to; )s00: Figure3.(qi!w)and(qi?w) g 9
10 10 RECEIVE-SEND-STAR(queueidi,wordw1,queueidj,wordw2,QDD(M;S; ;s0;f))f Letnbethegreatestintegersuchthat LetA0denotetheQDD(M;S;;s0;F); Forallk,1kn+1,computeAk=SEND(j;w2,RECEIVE(i;w1;Ak 1)); with81k<ln+1:sk6=sl; 9s1;:::sn+12S:s1w1 )s2w1 )w1 )sn+1; IfL(An+1)6=;: IfL(An+1)=;: Letp=1; WhileL(An+1)6=L(RECEIVE(i;wp1;An+1)): ReturnDETERMINIZE([nk=0Ak); Forallk,2kp,computeAn+k=SEND(j;w2,RECEIVE(i; ComputeAn+p+1=SEND-STAR(j;wp2;DETERMINIZE([n+p w1;an+k 1)); p:=p+1; greturndeterminize([n+p+1 k=0ak). k=n+1ak)); Figure4.(qi?w1;qj!w2)
11 STAR(i,w,A),andletL(A0)denotethelanguageacceptedbyA0.ThenA0isa Theorem4LetAbeaQDD,letA0denotetheautomatonreturnedbyRECEIVE- 11 Proof:SeeAppendix. QDDsuchthatL(A0)=L(qi?w)(A). Lemma1LetnandAn+1beasdenedinthealgorithmRECEIVE-SEND-STAR(i; w1;j;w2;a),withi6=j.ifthelanguageacceptedbyan+1isnotempty,thenthere existspsuchthat0<p(n+1)!,andl(an+1)=l(receive(i;wp1;an+1)). SEND-STAR(i,w1,j,w2,A),,withi6=j,andletL(A0)denotethelanguage Theorem5LetAbeaQDD,letA0denotetheautomatonreturnedbyRECEIVE- Proof:SeeAppendix. Proof:SeeAppendix. acceptedbya0.thena0isaqddsuchthatl(a0)=l(qi?w1;qj!w2)(a). 6.ExperimentalResults languagel(qi?w1;qj!w2)(a)isregular. Itisworthnoticingthat,asacorollaryofthelasttheorem,wehavethatthe addedtothesetoftransitionsofsender,andthemeta-transitions(1;(stor?msg1; ConsideragaintheAlternating-BitprotocolofExample.Meta-transitionsare RtoS!ack1);1)and(5;(StoR?msg0;RtoS!ack0);5)areaddedtothesetoftransitionsofReceiver. (qi?w1;qj!w2).precisely,themeta-transitions(3;(rtos?ack1;stor!msg0);3), (3;(StoR!msg0);3),(8;(RtoS?ack0;StoR!msg1);8)and(8;(StoR!msg1);8)are addedtotheprotocoldescriptionforloopsthatmatcheither(qi!w),(qi?w),or havecombineditwithaloop-rstsearch.startingwiththecontrolstate(1;1)and theqdd(m;fs0g;fg;s0;fs0g),whichcorrespondstothequeue-content"forboth thealgorithmsformanipulatingqddsdescribedintheprevioussection,andwe queuesstorandrtos,theexecutionoftheloop-rstsearchforthealternating-bit Wehaveimplemented(inC)a\QDD-package"containinganimplementationof initialstate. duringthesearchcontains21states,and52controlstatesarereachablefromthe protocolterminatesafter5.9secondsofcomputationonasparc10workstation. Thenumberof(meta-)transitionsexecutedis331.ThelargestQDDconstructed oftheprotocolobtainedattheendofthesearch.forinstance,itisthenstraightforwardtoprovethattheprotocoldoesnotcontainanydeadlocks,thatthereare reachablecontrolstateswherethenumberofmessagesinaqueueisunbounded, thatmessagesarealwaysdeliveredinthecorrectorder,etc. Manypropertiescanbecheckedonthesymbolicrepresentationofthestatespace wherethetransitionslabeledby\timeout"areremovedfromtheprotocoldescrip- OurtoolhasalsobeentestedonseveralvariantsoftheAlternating-Bitprotocol,
12 12 A).Wealsoperformedexperimentsonseveralsimplesliding-windowprotocols[26], abletransmissionmedia).inordertohandlethiscase,itissucienttodeneone additionalalgorithmsend-lossy(i,w,a),thatmerelyreturnsa[send(i,w, interestingvariantisthecasewherequeuesmaylosemessages(tomodelunreli- tion,wherethesender/receiverhavevariousnumberofcontrolstates,etc.an than20intotal),ourtoolwasabletosuccessfullyterminateitssearchwithina withvariouswindowsizes.foralltheseexampleswithinnitestatespaces(more fewminutesofcomputation.thisshowsthat,atleastforthisparticularthough importantclassofexamples,ourvericationmethodisveryusefulandrobust. 7.ComparisonwithOtherWorkandConclusions Protocolandthepropertiesdiscussedintheprevioussection,whichwereeasily 12,13,15,16,24,25].Thesesub-classesdonotcover,e.g.,theAlternating-Bit tainedforthevericationofspecicpropertiesforlimitedsub-classes[2,3,10,11, Althoughmostvericationproblemsareundecidableforarbitraryprotocolsmod- veriedusingaloop-rstsearchandqdds. eledbycommunicatingnite-statemachines,decisionprocedureshavebeenob- queue-contentsassociatedwiththatcontrolstatecanberepresentedbyaqdd. Theclassofprotocolscharacterizedbytheabovenecessaryconditionisequivalent gorithmisthat,forallreachablecontrolstatesoftheprotocol,thelanguageof totheclassofprotocolsforwhich,foreachreachablecontrolstateoftheprotocol, Clearly,anecessary,butnotsucient,conditionfortheterminationofoural- setofqueue-contentsrepresentedbyaqddisarecognizablelanguage. (i.e.,aniteunionofcartesianproductsofregularexpressions).indeed,itcanbe thesetofpossiblequeue-contentscanbedescribedbyarecognizableexpression shownthatanyrecognizablelanguagecanberepresentedbyaqdd,andthatany suchrecognizableexpressions,foranyprotocolintheclassdenedabove,cannot protocol.actually,from[11],itiseasytoshowthatanalgorithmforconstructing ableexpressionrepresentingallpossiblequeue-contentsforeachcontrolstateofthe aboveclassofprotocols.however,nomethodisgivenforconstructingarecogniz- In[20],itispointedoutthatseveralvericationproblemsaredecidableforthe exist.incontrast,ourcontributionistoprovideapracticalalgorithmwhichisable allofthem{thisisimpossibleanyway. tocomputesucharepresentationforprotocolsintheaboveclass,althoughnotfor possibletodesignalgorithmsonqddsforothertypesofmeta-transitionsaswell. ofexecutingthreefrequenttypesofmeta-transitions.thesealgorithmsweresucientforanalyzingtheprotocolsconsideredintheprevioussection.however,itis Inthispaper,wehavepresentedalgorithmsonQDDsforcomputingtheeect Interestingfutureworkistocharacterizepreciselythesetofmeta-transitionsthat inaforthcomingpaper. oftheexecutionofanymeta-transitioninthisclass.thesetopicswillbeaddressed preserverecognizabilityandtoprovideagenericalgorithmforcomputingtheeect equations"fromthedescriptionofasetofcommunicatingnite-statemachines.by In[21],avericationmethodbasedondata-owanalysisisusedtogenerate\ow
13 thattheoriginalsystemisfreeofcertaintypesoferrors.incontrast,ouralgorithm computingapproximationsofsolutionsfortheseequations,itispossibletoshow 13 analyzed.thisenablesusnotonlytoprovetheabsenceoferrors,butalsoto detecterrorsandtoexhibittotheusersequencesoftransitionsthatleadtoerrors. isabletoproduceanexactrepresentationofthestatespaceoftheprotocolbeing Notethat,obviously,approximationscouldalsobeusedinourframework,e.g.,for simplifyingqddswhentheybecometoocomplex,orwhenthesearchdoesnot seemtostop.fortheexampleswehaveconsideredsofar,noapproximationswere necessary. ically(datapart)alreadyappearedin[1]forthevericationofreal-timesystems, wheredense-timedomainsarerepresentedbypolyhedra.thisideaalsoappeared ThesesymbolicrepresentationsarequitedierentfromQDDs. in[7],wherethevaluesofintegervariablesarerepresentedbyperiodicvectorsets. Theideaofrepresentingstatespartlyexplicitly(controlpart)andpartlysymbol- abooleanfunction(withanitedomain)asadirectedacyclicgraph.in[14], sentationiscertainlythebinarydecisiondiagram(bdd)[5],whichrepresents itisshownhowqddscanbecombinedwithbddstoimprovetheeciencyof classicalbdd-basedsymbolicmodel-checkingmethodsforverifyingpropertiesof Fordigitalhardwareverication[4],themostcommonlyusedsymbolicrepre- communicationprotocolswithlargenitestatespaces. apreliminaryversionofthispaper. WewishtothankMichaelMerrittandMarkStaskauskasforhelpfulcommentson Acknowledgments References 3.P.A.AbdullaandB.Jonsson.Undecidablevericationproblemsforprogramswithunreliable 1.R.Alur,C.Courcoubetis,andD.Dill.Model-checkingindensereal-time.Informationand 2.P.A.AbdullaandB.Jonsson.Verifyingprogramswithunreliablechannels.InProceedings channels.inproc.icalp-94,volume820oflecturenotesincomputerscience,pages316{ 327.Springer-Verlag,1994. ofthe8thieeesymposiumonlogicincomputerscience,1993. Computation,104(1):2{34,May R.E.Bryant.Symbolicbooleanmanipulationwithorderedbinary-decisiondiagrams.ACM 4.J.R.Burch,E.M.Clarke,K.L.McMillan,D.L.Dill,andL.J.Hwang.Symbolicmodelchecking:1020statesandbeyond.InProceedingsofthe5thSymposiumonLogicinComputer 6.K.Bartlett,R.Scantlebury,andP.Wilkinson.Anoteonreliablefull-duplextransmissions ComputingSurveys,24(3):293{318,1992. Science,pages428{439,Philadelphia,June B.BoigelotandP.Wolper.Symbolicvericationwithperiodicsets.InProc.6thConference 8.D.BrandandP.Zaropulo.Oncommunicatingnite-statemachines.JournaloftheACM, 55{67,Stanford,June1994.Springer-Verlag. oncomputeraidedverication,volume818oflecturenotesincomputerscience,pages 2(5):323{342,1983. overhalf-duplexlines.communicationsoftheacm,2(5):260{261, E.M.Clarke,E.A.Emerson,andA.P.Sistla.Automaticvericationofnite-stateconcurrent systemsusingtemporallogicspecications.acmtransactionsonprogramminglanguages andsystems,8(2):244{263,january1986.
14 14 11.G.Cece,A.Finkel,andS.Purushothaman.Unreliablechannelsareeasiertoverifythan 10.A.ChoquetandA.Finkel.SimulationoflinearFIFOnetshavingastructuredsetofterminal 12.A.Finkel.AnewclassofanalyzablecfsmswithunboundedFIFOchannels.InProc.8th markings.inproc.8theuropeanworkshoponapplicationandtheoryofpetrinets,pages 95{112,Saragoza,1987. perfectchannels.informationandcomputation,124(3):20{31,1996. IFIPWG6.1InternationalSymposiumonProtocolSpecication,Testing,andVerication, 14.P.GodefroidandD.E.Long.SymbolicProtocolVericationwithQueueBDDs.InProceedingsofthe11thIEEESymposiumonLogicinComputerScience,NewBrunswick,July ofcommunicatingnite-statemachines.computersandarticialintelligence,6(3):209{228, 13.M.G.Gouda,E.M.Gurari,T.H.Lai,andL.E.Rosier.Ondeadlockdetectioninsystems pages1{12,atlanticcity,1988.north-holland. 15.T.Jeron.TestingforunboundednessofFIFOchannels.InProc.STACS-91:Symposiumon M.T.Liu.Protocolengineering.AdvancesinComputing,29:79{195, R.M.KarpandR.E.Miller.Parallelprogramschemata.JournalofComputerandSystem Sciences,3(2):147{195,1969. pages322{333,hamburg,1991.springer-verlag. TheoreticalAspectsofComputerScience,volume480ofLectureNotesinComputerScience, 18.H.R.LewisandC.H.Papadimitriou.ElementsoftheTheoryofComputation.Prentice 20.J.K.Pachl.Protocoldescriptionandanalysisbasedonastatetransitionmodelwithchannel 19.O.LichtensteinandA.Pnueli.Checkingthatnitestateconcurrentprogramssatisfytheir gramminglanguages,pages97{107,neworleans,january1985. Hall,1981. expressions.inproc.7thifipwg6.1internationalsymposiumonprotocolspecication, Testing,andVerication.North-Holland,1987. linearspecication.inproceedingsofthetwelfthacmsymposiumonprinciplesofpro- 21.W.PengandS.Purushothaman.Dataowanalysisofcommunicatingnitestatemachines. 23.H.Rudin.Networkprotocolsandtoolstohelpproducethem.AnnualReviewofComputer 22.J.P.QuielleandJ.Sifakis.SpecicationandvericationofconcurrentsystemsinCESAR.In pages337{351.springer-verlag,1981. Proc.5thInt'lSymp.onProgramming,volume137ofLectureNotesinComputerScience, ACMTransactionsonProgrammingLanguagesandSystems,13(3):399{442, L.E.RoyerandH.C.Yen.Boundedness,emptychanneldetectionandsynchronizationfor Science,2:291{316, A.Tanenbaum.ComputerNeworks.PrenticeHall, A.P.SistlaandL.D.Zuck.Automatictemporalvericationofbuersystems.InProc. Science,pages93{103,Aalborg,July1991.Springer-Verlag. 3rdWorkshoponComputerAidedVerication,volume575ofLectureNotesinComputer communicatingniteautomata.theoreticalcomputerscience,44:69{105, M.Y.VardiandP.Wolper.Anautomata-theoreticapproachtoautomaticprogramverication.InProceedingsoftheFirstSymposiumonLogicinComputerScience,pages322{331, Cambridge,June1986.
15 15 Appendix CorrectnessProofs Theorem3LetAbeaQDD,letA0denotetheautomatonreturnedbySEND(i, w,a),andletl(a0)denotethelanguageacceptedbya0.thena0isaqddsuch thatl(a0)=lqi!w(a). Proof: LetusproverstthatLqi!w(A)L(A0).LetubeawordinL(A).Hence, thereexistsapath=s0m0!s1m1!mn 1!sninAacceptingu.Since u=ujm1ujmn,containsexactlyonestateslsuchthat8k<l:mk2 [ij=1mjand8kl:mk2[nj=i+1mj.therefore,slisastate\s"that satisestheconditioninline3ofthealgorithm,andthealgorithmreplacesthe transition(sl;ml;sl+1)(ifany)by(s0;ml;sl+1),wherethestates0isanewstate addedbythealgorithm.moreover,thealgorithmalsoadds(sl;w;s0)totheset oftransitionsofa.sinceallsequencesoftransitionslabeledbyasymbolin [Nj=i+1MjarepreservedinA0(anewstates0isassociatedtoeveryintermediate statesthatsatisestheconditioninline3,andalltheincoming(outgoing) transitionsto(resp.from)slabeledbyasymbolin[nj=i+1mjaremappedto transitionsofsamelabelto(resp.from)s0),beforebeingdeterminized,the resultingautomatoncontainsthepath0=s0m0!ml 1!slw!s0ml!s0l+1ml+1! mn 1!s0n.Inthecasewhereml 1isthelasttransitionof,slisacceptingin A,andisreplacedbys0inthesetofacceptingstatesofA0.Inanycase,thepath 0isaccepting,andtheautomatonA0acceptsujM1ujMiwujMi+1ujMN. Now,weshowthatL(A0)Lqi!w(A).LetubeawordinL(A0),andletA00be theautomatonobtainedbeforethedeterminizationoperationgivinga0.since theautomataa0anda00acceptthesamelanguage,u2l(a00)andthereexists apathofa00acceptingu.letusshowthatisoftheform1(s;w;s0)2, where1iscomposedonlyoftransitionslabeledbyasymbolin[ij=1mjwhile 2iscomposedonlyoftransitionslabeledbyasymbolin[Nj=i+1Mj. Since1leadsfroms0tosandiscomposedoftransitionslabeledbyasymbol in[ij=1mj,statessatisestheconditiononline3ofthealgorithm,andhence cannotbeacceptingina00.moreover,thereexistsatransition(s;w;s0)ina00 addedbythealgorithm(atline10).sincethealgorithmdoesnotperformany modicationontransitionslabeledbyasymbolin[ij=1mj,allthetransitionsof 1aretransitionsinA.Sinceallsequencesoftransitionslabeledbyasymbolin [Nj=i+1MjarepreservedinA0(anewstates0isassociatedtoeveryintermediate statesthatsatisestheconditioninline3,andalltheincoming(outgoing) transitionsto(resp.from)slabeledbyasymbolin[nj=i+1mjaremappedto transitionsofsamelabelto(resp.from)s0),thereexistsinaapath02froms correspondingtothesamesequenceoftransitionsasin2.sincethelaststate of2isacceptingina00,thelaststateof02isacceptingina.thus,theword vsuchthat8k6=i:vjmk=ujmkandvjmiw=ujmi,isacceptedbya.
16 16 Theorem4LetAbeaQDD,letA0denotetheautomatonreturnedbyRECEIVE(i, w,a),andletl(a0)denotethelanguageacceptedbya0.thena0isaqddsuch thatl(a0)=lqi?w(a). Proof: LetusproverstthatLqi?w(A)L(A0).Letu=u1wu2beawordinL(A), withu1(resp.u2)onlycomposedofsymbolsin[i 1 j=1mj(resp.[nj=imj).there existsapath=s0m0!s1m1!mn 1!sninAacceptingu.Sinceu= ujm1ujmn,containsexactlyonestateslsuchthat8k<l:mk2[i 1 j=1mj and8kl:mk2[nj=imj.therefore,slisastate\s"thatsatisesthe conditioninline3ofthealgorithm,andthealgorithmreplacesthetransition (sl;ml;sl+1)by(s0;ml;sl+1),wherethestates0isanewstateaddedbythe algorithm.moreover,itfollowsfromthedenitionofuthatcontainsexactly onestatespsuchthatslw)sp.thestatespsatisestheconditionatline10of thealgorithm,hencethealgorithmadds(s;";sp)tothesetoftransitionsofa. Sinceallsequencesoftransitionslabeledbyasymbolin[Nj=iMjarepreserved ina0(anewstates0isassociatedtoeveryintermediatestatesthatsatisesthe conditioninline3,andalltheincoming(outgoing)transitionsto(resp.from) slabeledbyasymbolin[nj=imjaremappedtotransitionsofsamelabelto (resp.from)s0),beforebeingdeterminized,theresultingautomatoncontains thepath0=s0m0!ml 1!sl"!spmp!s0p+1mn 1!s0n.Sincethepath0is accepting,theautomatona0acceptsthewordu1u2. Now,weshowthatL(A0)Lqi?w(A).LetubeawordinL(A0),andletA00be theautomatonobtainedbeforethedeterminizationoperationgivinga0.since theautomataa0anda00acceptthesamelanguage,u2l(a00)andthereexists apathofa00acceptingu.letusshowthatisoftheform12,where 1iscomposedonlyoftransitionslabeledbyasymbolin[i 1 j=1mjwhile2is composedonlyoftransitionslabeledbyasymbolin[nj=imj. Since1leadsfroms0tosandiscomposedoftransitionslabeledbyasymbol in[i 1 j=1mj,statessatisestheconditiononline3ofthealgorithm,andhence cannotbeacceptingina00.moreover,theonlyoutgoingtransitionfromsnot labeledbyasymbolin[i 1 j=1mjcanonlybeatransition(s;";s00)addedby thealgorithm(atline11),withsw)s00ina.sincethealgorithmdoesnot performanymodicationontransitionslabeledbyasymbolin[i 1 j=1mj,allthe transitionsof1aretransitionsina.sinceallsequencesoftransitionslabeled byasymbolin[nj=imjarepreservedina0(anewstates0isassociatedtoevery intermediatestatesthatsatisestheconditioninline3,andalltheincoming (outgoing)transitionsto(resp.from)slabeledbyasymbolin[nj=imjare mappedtotransitionsofsamelabelto(resp.from)s0),thereexistsinaapath 02froms00correspondingtothesamesequenceoftransitionsasin2.Sincethe
17 17 laststateof2isacceptingina00,thelaststateof02isacceptingina.thus, thewordvsuchthat8k6=i:vjmk=ujmkandvjmi=wujmi,isacceptedby A. Theorem5LetAbeaQDD,letA0denotetheautomatonreturnedbySEND- STAR(i,w,A),andletL(A0)denotethelanguageacceptedbyA0.ThenA0isa QDDsuchthatL(A0)=L(qi!w)(A). Proof: LetusproverstthatL(qi!w)(A)L(A0).LetubeawordinL(A).Hence, thereexistsapath=s0m0!s1m1!mn 1!sninAacceptingu.Sinceu= ujm1ujmn,containsexactlyonestateslsuchthat8k<l:mk2[ij=1mj and8kl:mk2[nj=i+1mj.therefore,slisastate\s"thatsatisesthe conditioninline3ofthealgorithm,andthealgorithmreplacesthetransition (sl;ml;sl+1)(ifany)byby(s00;ml;sl+1),wherethestates00isanewstate addedbythealgorithm.moreover,thealgorithmalsocreatesanothernew states0andaddsthetransitions(sl;";s0),(s0;";s00)and(s0;w;s0)totheset oftransitionsofa.sinceallsequencesoftransitionslabeledbyasymbolin [Nj=i+1MjarepreservedinA0(anewstates00isassociatedtoeveryintermediate statesthatsatisestheconditioninline3,andalltheincoming(outgoing) transitionsto(resp.from)slabeledbyasymbolin[nj=i+1mjaremapped totransitionsofsamelabelto(resp.from)s00),beforebeingdeterminized, theresultingautomatoncontainsthepath0=s0m0!ml 1!sl"!s0"! s00ml!s0l+1ml+1!mn 1!s0n.Inthecasewhereml 1isthelasttransitionof,slisacceptinginA,andisreplacedbys00inthesetofacceptingstatesof A0.Inanycase,thepath0isaccepting.Letk0beanarbitraryinteger. SincethesetoftransitionsofA0containsthetransition(s0;w;s0),thepath 0k=s0m0!ml 1!sl"!s0wk!s0"!s00ml!s0l+1ml+1!mn 1!s0nisalsoan acceptingpathofa0.itfollowsthatforanyk0,theautomatona0accepts ujm1ujmiwkujmi+1ujmn. Now,weshowthatL(A0)L(qi!w)(A).LetubeawordinL(A0),andlet A00betheautomatonobtainedbeforethedeterminizationoperationgivingA0. SincetheautomataA0andA00acceptthesamelanguage,u2L(A00)and thereexistsapathofa00acceptingu.letusshowthatisoftheform 1or1(s;";s0)(s0;w;s0)k(s0;";s00)2,where1iscomposedonlyoftransitions labeledbyasymbolin[ij=1mj,2iscomposedonlyoftransitionslabeledby asymbolin[nj=i+1mj,andk0. Since1leadsfroms0tosandiscomposedoftransitionslabeledbyasymbol in[ij=1mj,statessatisestheconditiononline3ofthealgorithm.moreover, thereexisttransitions(s;";s0),(s0;w;s0)and(s0;";s00)addedbythealgorithm
18 18 (atline10).sincethealgorithmdoesnotperformanymodicationontransitionslabeledbyasymbolin[ij=1mj,allthetransitionsof1aretransitions ina.moreover,if1isanacceptingpathina00,thenitisalsoanaccepting pathina.hence,if=1,thenu2l(a).letusassumenowthat6=1. Sinceallsequencesoftransitionslabeledbyasymbolin[Nj=i+1Mjarepreserved ina0(anewstates00isassociatedtoeveryintermediatestatesthatsatises theconditioninline3,andalltheincoming(outgoing)transitionsto(resp. from)slabeledbyasymbolin[nj=i+1mjaremappedtotransitionsofsame labelto(resp.from)s00),thereexistsinaapath02fromscorrespondingto thesamesequenceoftransitionsasin2.sincethelaststateof2isacceptingina00,thelaststateof02isacceptingina.thus,thewordvsuchthat 8j6=i:vjMj=ujMjandvjMiwk=ujMi,isacceptedbyA. Theorem6LetAbeaQDD,letA0denotetheautomatonreturnedbyRECEIVE- STAR(i,w,A),andletL(A0)denotethelanguageacceptedbyA0.ThenA0isa QDDsuchthatL(A0)=L(qi?w)(A). Proof: LetusproverstthatL(qi?w)(A)L(A0).Letu=u1wku2beawordin L(A),withu1(resp.u2)onlycomposedofsymbolsin[i 1 j=1mj(resp.[nj=imj), andk0.thereexistsapath=s0m0!s1m1!mn 1!sninAacceptingu. Sinceu=ujM1ujMN,containsexactlyonestateslsuchthat8k<l:mk2 [i 1 j=1mjand8kl:mk2[nj=imj.therefore,slisastate\s"thatsatisesthe conditioninline3ofthealgorithm,andthealgorithmreplacesthetransition (sl;ml;sl+1)by(s0;ml;sl+1),wherethestates0isanewstateaddedbythe algorithm.moreover,itfollowsfromthedenitionofuthatcontainsexactly onestatespsuchthatslwk )sp.thestatespsatisestheconditionatline10of thealgorithm,hencethealgorithmadds(s;";sp)tothesetoftransitionsofa. Sinceallsequencesoftransitionslabeledbyasymbolin[Nj=iMjarepreserved ina0(anewstates0isassociatedtoeveryintermediatestatesthatsatisesthe conditioninline3,andalltheincoming(outgoing)transitionsto(resp.from) slabeledbyasymbolin[nj=imjaremappedtotransitionsofsamelabelto (resp.from)s0),beforebeingdeterminized,theresultingautomatoncontains thepath0=s0m0!ml 1!sl"!spmp!s0p+1mn 1!s0n.Sincethepath0is accepting,theautomatona0acceptsthewordu1u2. Now,weshowthatL(A0)Lqi?w(A).LetubeawordinL(A0),andletA00be theautomatonobtainedbeforethedeterminizationoperationgivinga0.since theautomataa0anda00acceptthesamelanguage,u2l(a00)andthereexists apathofa00acceptingu.letusshowthatisoftheform1or12,where 1iscomposedonlyoftransitionslabeledbyasymbolin[i 1 j=1mjwhile2is composedonlyoftransitionslabeledbyasymbolin[nj=imj.
19 19 Since1leadsfroms0tosandiscomposedoftransitionslabeledbyasymbolin [i 1 j=1mj,statessatisestheconditiononline3ofthealgorithm.moreover,the onlyoutgoingtransitionfromsnotlabeledbyasymbolin[i 1 j=1mjcanonlybe atransition(s;";s00)addedbythealgorithm(atline11),withswk )s00ina,and k0.sincethealgorithmdoesnotperformanymodicationontransitions labeledbyasymbolin[i 1 j=1mj,allthetransitionsof1aretransitionsina. Moreover,if1isanacceptingpathinA00,thenitisalsoanacceptingpath ina.hence,if=1,thenu2l(a).letusassumenowthat6=1. Sinceallsequencesoftransitionslabeledbyasymbolin[Nj=iMjarepreserved ina0(anewstates0isassociatedtoeveryintermediatestatesthatsatises theconditioninline3,andalltheincoming(outgoing)transitionsto(resp. from)slabeledbyasymbolin[nj=imjaremappedtotransitionsofsamelabel to(resp.from)s0),thereexistsinaapath02froms00correspondingtothe samesequenceoftransitionsasin2.sincethelaststateof2isaccepting ina00,thelaststateof02isacceptingina.thus,thewordvsuchthat 8j6=i:vjMj=ujMjandvjMi=wkujMi,isacceptedbyA. Lemma2LetnandAn+1beasdenedbythealgorithmcomputingthevalueof RECEIVE-SEND-STAR(i;w1;j;w2;A).IfthelanguageacceptedbyAn+1isnot empty,thenthereexistsp>0suchthatan+1andreceive(i;wp1;an+1)accept thesamelanguage. Proof: First,weprovethatL(An+1)L(RECEIVE(i;wp1;An+1))forsomep>0. LetwbeawordinL(An+1).Foranysuchword,thereexistsw02L(A)such thatw0jmi=wn+1 1(wjMi),wjMj=(w0jMj)wn+1 2,and8k62fi;jg:wjMk= w0jmk.lets0;s1;:::;sxbethepathofaacceptingw0.itcontainsasubpath sy;sy+1;:::;sy+n+1suchthatsyw1 )sy+1w1 )w1 )sy+n+1ands0w00 )sy,with w00=w0jm1w0jmi 1.Bydenitionofn,thissubpathcontainsaloop,i.e., thereexistszandlsuchthatyzy+n+1,1nn+1,andszwl1 )sz. Wethushave8k0:w0jM1w0jMi 1wkl 1w0jMiw0jMN2L(A).Choosing k=(n+1)!=l,weobtainw0jm1w0jmi 1w(n+1)! 1 w0jmiw0jmn2l(a),which implieswjm1wjmi 1w(n+1)! 1 wjmiwjmn2l(an+1).bytakingp=(n+1)! andapplyingthisresulttoallthewordswinl(an+1),itfollowsthatl(an+1) L(RECEIVE(i;wp1;An+1)). Now,weshowthatL(RECEIVE(i;wp1;An+1))L(An+1)forthesamep= (n+1)!.letw2l(receive(i;wp1;an+1)).thereexistsw02l(a)such thatw0jmi=wp+n+1 1 wjmi,wjmj=w0jmjwn+1 2,and8k62fi;jg:wjMk= w0jmk.lets0;s1;:::;sxbethepathofa0acceptingw0.bydenitionofn, thispathcontainsasubpathsy;sy+1;:::;szsuchthats0w00 )sy,withw00=
20 20kandlaresuchthatk:lpandln+1.Byremovingexactlyp=loccurrences w ofthisloopfromthepaths0;s1;:::;sx,weobtainapathofaacceptingthe wordw000suchthatw000jmi=wn+1 0jM1w0jMi 1,thatbeginswithkoccurrencesofaloopacceptingwl1,where wjmk=w000jmk.therefore,w2l(an+1). 1wjMi,wjMj=w000jMjwn+1 2,and8k62fi;jg: w2;a),withi6=j,thena0isaqddsuchthatl(a0)=(qi?w1;qj!w2)(l(a)). Theorem7IfAisaQDDandA0isreturnedbyRECEIVE-SEND-STAR(i;w1;j; Proof:Letn,p,fAkgbeasdenedbythealgorithmcomputingRECEIVE- SEND-STAR.Wehave: (qi?w1;qj!w2)(l(a)) =1[k=0(qi?w1;qj!w2)k(L(A)) =n[k=0(qi?w1;qj!w2)k(l(a))[1[ =n[k=0l(ak)[1[k=0(qi?w1;qj!w2)k(l(an+1)): k=n+1(qi?w1;qj!w2)k(l(a)) IfL(An+1)6=;:Asi6=j,theoperationsqi?m1andqj!m2commute.Hence, IfL(An+1)=;:Wehave(qi?w1;qj!w2)(L(A))=n[k=0L(Ak)=L(A0). wehave: 1[k=0(qi?w1;qj!w2)k(L(An+1)) =1[i=0p 1 [j=0(qj!w2)pi(qi?w1;qj!w2)j(qi?w1)pi(l(an+1)): [j=0(qi?w1;qj!w2)pi+j(l(an+1)) Bydenitionofp,(qi?w1)pi(L(An+1))=L(An+1).Thus,wehave: 1[k=0(qi?w1;qj!w2)k(L(An+1)) =1[i=0p 1 [j=0(qj!w2)pi(qi?w1;qj!w2)j(l(an+1))
KeyEscrowinMutuallyMistrustingDomains?
KeyEscrowinMutuallyMistrustingDomains? Abstract.Inthispaperwepresentakeyescrowsystemwhichmeets L.Chen,D.GollmannandC.J.Mitchell possiblerequirementsforinternationalkeyescrow,wheredierentdomainsmaynottrusteachother.inthissystemmultiplethirdparties,
More informationTransport Layer. Chapter 3.4. Think about
Chapter 3.4 La 4 Transport La 1 Think about 2 How do MAC addresses differ from that of the network la? What is flat and what is hierarchical addressing? Who defines the IP Address of a device? What is
More informationŹ Ź ł ź Ź ś ź ł ź Ś ę ż ż ł ż ż Ż Ś ę Ż Ż ę ś ź ł Ź ł ł ż ż ź ż ż Ś ę ż ż Ź Ł Ż Ż Ą ż ż ę ź Ń Ź ś ł ź ż ł ś ź ź Ą ć ś ś Ź Ś ę ę ć ż Ź Ą Ń Ą ł ć ć ł ł ź ę Ś ę ś ę ł ś ć ź ś ł ś ł ł ł ł ć ć Ś ł ź Ś ł
More informationRouch, Jean. Cine-Ethnography. Minneapolis, MN, USA: University of Minnesota Press, 2003. p 238
Minneapolis, MN, USA: University of Minnesota Press, 2003. p 238 http://site.ebrary.com/lib/uchicago/doc?id=10151154&ppg=238 Minneapolis, MN, USA: University of Minnesota Press, 2003. p 239 http://site.ebrary.com/lib/uchicago/doc?id=10151154&ppg=239
More informationSCHOOLOFCOMPUTERSTUDIES RESEARCHREPORTSERIES UniversityofLeeds Report95.4
SCHOOLOFCOMPUTERSTUDIES RESEARCHREPORTSERIES UniversityofLeeds Report95.4 AcquisitionsandApplications Generic3-DShapeModel: DivisionofArticialIntelligence XShen&DCHogg by February1995 sequencesandrepresentedbythecontrolpointsofab-splinesurface.the
More informationA Semantic Analysis of Wireless Network Security Protocols
A Semantic Analysis of Wireless Network Security Protocols Massimo Merro (joint work with Damiano Macedonio) Dipartimento di Informatica Università degli Studi di Verona - Italy NFM 2012 - Norfolk, April
More informationConfiguring Timeout, Retransmission, and Key Values Per RADIUS Server
Configuring Timeout, Retransmission, and Key Values Per RADIUS Server Feature Summary The radius-server host command functions have been extended to include timeout, retransmission, and encryption key
More informationA Simple Model for Calculating SIP Signalling Flows in 3GPP IP Multimedia Subsystems
A Simple Model for Calculating SIP Signalling Flows in 3GPP IP Multimedia Subsystems Alexander A. Kist and Richard J. Harris RMIT University, BOX 2476V, Victoria 3001, Australia {kist,richard}@catt.rmit.edu.au
More informationAmyP.Felty1,DouglasJ.Howe1,andFrankA.Stomp2 ProtocolVericationinNuprl? 2Dept.ofComp.Sci.,UCDavis,Davis,CA95616,USA.stomp@cs.ucdavis.edu 1BellLabs,MurrayHill,NJ07974,USA.ffelty,howeg@bell-labs.com whileretainingexistingadvantagesofthesystem,anddescribesapplicationoftheprovertoverifyingthescicachecoherenceprotocol.the
More informationTABLE OF CONTENTS: Online Appendix
TABLE OF CONTENTS: Online Appendix APPENDIX A MAIN EFFECT 1 FIGURE A.1. ARIZONA, MICHIGAN, MINNESOTA, AND WISCONSIN 1 APPENDIX B MAIN EFFECT 2-5 FIGURE B.1. COLORADO, GRADE 3 2 FIGURE B.2. COLORADO, GRADE
More informationPrivate Developer Ground Lease. Example (Denver) C-1
Appendix C Private Developer Ground Lease Example (Denver) C-1 C-2 C-3 C-4 C-5 C-6 C-7 C-8 C-9 C-10 C-11 C-12 C-13 C-14 C-15 C-16 C-17 C-18 C-19 C-20 C-21 C-22 C-23 C-24 C-25 C-26 C-27 C-28 C-29 C-30 C-31
More informationč é é č Á Ě Č Á š Á Ó Á Á ď ú ď Š ň Ý ú ď Ó č ď Ě ů ň Č Š š ď Ň ď ď Č ý Ž Ý Ý Ý ČÚ Ž é úč ž ý ž ý ý ý č ů ý é ý č ý ý čů ý ž ž ý č č ž ž ú é ž š é é é č Ž ý ú é ý š é Ž č Ž ů Ů Ť ý ý ý Á ý ý Č Ť É Ď ň
More informationrecent)algorithmcalledbdm.bdmskipscharactersusinga\suxau-
1Dept.ofComputerScience,UniversityofChile.BlancoEncalada2120,Santiago, ABit-parallelApproachtoSuxAutomata: FastExtendedStringMatching Abstract.Wepresentanewalgorithmforstringmatching.Thealgorithm,calledBNDM,isthebit-parallelsimulationofaknown(butomaton"whichismadedeterministicinthepreprocessing.BNDM,in-
More informationNormalizingIncompleteDatabases
NormalizingIncompleteDatabases Abstract 600MountainAvenue,MurrayHill,NJ07974USA E-mail:libkin@research.att.com AT&TBellLaboratories LeonidLibkin Databasesareoftenincompletebecauseofthepresence ofdisjunctiveinformation,duetoconicts,partialknowledgeandotherreasons.queriesagainstsuchdatabaseswithnullvalues[akg91,il84],isdisjunctiveinforticsofsuchdatabasesandprovenormalizationtheorems
More informationProviding quality of service (QoS) guarantees
INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT Int. J. Network Mgmt 2000; 10:75 90 Monitoring QoS distribution in multimedia networks By Chen-Khong Tham, Yuming Jiang Ł and Chi-Chung Ko This paper presents
More informationAN IMPROVED REAL-TIME TRAFFIC FLOW MONITORING SCHEME
AN IMPROVED REAL-TIME TRAFFIC FLOW MONITORING SCHEME Yuming Jiang, Chen-Khong Tham, Chi-Chung Ko Department Electrical Engineering National University Singapore, Singapore 119260 Email: engp7450, eletck,
More informationImproving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation
Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation R.Navaneethakrishnan Assistant Professor (SG) Bharathiyar College of Engineering and Technology, Karaikal, India.
More informationChristoph Sorge. February 12th, 2014 Bitcoin minisymposium at KNAW
Bitcoin s Peer-to-Peer network Christoph Sorge February 12th, 2014 Bitcoin minisymposium at KNAW Clipart source: http://openclipart.org, users Machovka and Keistutis Department of Computer Science What
More informationData Link Layer. Flow Control. Flow Control
Data Link Layer Flow Control 1 Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a transmitting station does not overflow a receiving station
More informationThe English translation Of MBA Standard 0301
MBA 文 書 0603 号 MBA Document 0603 The English translation Of MBA Standard 0301 MISAUTH Protocol Specification The authoritive specification is Japansese one, MBA Standard 0203 (June 2004). The Protocol
More informationA QOS DISTRIBUTION MONITORING SCHEME FOR PERFORMANCE MANAGEMENT OF MULTIMEDIA NETWORKS
A QOS DISTRIBUTION MONITORING SCHEME FOR PERFORMANCE MANAGEMENT OF MULTIMEDIA NETWORKS Yuming Jiang, Chen-Khong Tham, Chi-Chung Ko Department Electrical Engineering, National University Singapore, 119260
More informationOutline. TCP connection setup/data transfer. 15-441 Computer Networking. TCP Reliability. Congestion sources and collapse. Congestion control basics
Outline 15-441 Computer Networking Lecture 8 TCP & Congestion Control TCP connection setup/data transfer TCP Reliability Congestion sources and collapse Congestion control basics Lecture 8: 09-23-2002
More informationWHERE DOES THE 10% CONDITION COME FROM?
1 WHERE DOES THE 10% CONDITION COME FROM? The text has mentioned The 10% Condition (at least) twice so far: p. 407 Bernoulli trials must be independent. If that assumption is violated, it is still okay
More informationBachelor of Science or Arts Degree Minor Environmental Science Check List
Mathematics & 6 LA 10101 Freshman Success Mathematics & 6 LA 10101 Freshman Success Mathematics & 6 LA 10101 Freshman Success Mathematics & 6 LA 10101 Freshman Success Mathematics & 6 LA 10101 Freshman
More informationcurbi for Schools Technical Overview October 2014
curbi for Schools Technical Overview October 2014 Background Overview School Requirements curbi Standard Mode curbi School Mode curbi4schools ipad app Device Enrolment Process Features Alerts Costs Parent
More informationG d y n i a B u d o w a b o i s k a w i e l o f u n k c y j n e g o o n a w i e r z c h n i p o l i u r e t a n o w e j p r z y S z k o l e P o d s t a w o w e j n r 3 5 w G d y n i N u m e r o g ł o s
More informationIntroduction to Network Security. Topics
Introduction to Network Security Chapter 2 Network Protocols 1 Topics Protocol Specifications Protocol Addresses Protocol Headers 2 Protocol Specifications Open vs. Closed Specification methods English
More informationChapter 7. Matrices. Definition. An m n matrix is an array of numbers set out in m rows and n columns. Examples. ( 1 1 5 2 0 6
Chapter 7 Matrices Definition An m n matrix is an array of numbers set out in m rows and n columns Examples (i ( 1 1 5 2 0 6 has 2 rows and 3 columns and so it is a 2 3 matrix (ii 1 0 7 1 2 3 3 1 is a
More informationLUCOM GmbH * Ansbacher Str. 2a * 90513 Zirndorf * Tel. 09127/59 460-10 * Fax. 09127/59 460-20 * www.lucom.de
User module Advanced Security APPLICATION NOTE USED SYMBOLS Used symbols Danger important notice, which may have an influence on the user s safety or the function of the device. Attention notice on possible
More informationC Consiglio Nazionale delle Ricerche
DL00 Experience in implementing a Document Delivery Service Francesco Gennai,Marina B uzzi,laura Abba Istituto perle ApplicazioniTelem atiche {Francesco.G ennai,m arina.buzzi,laura.abba}@ iat.cnr.it Silvana
More informationNetwork Protocol Design and Evaluation
Network Protocol Design and Evaluation 08 - Analytical Evaluation Stefan Rührup Summer 2009 Overview In the last chapter: Simulation In this part: Analytical Evaluation: case studies 2 Analytical Evaluation
More informationarxiv:math/0601660v3 [math.nt] 25 Feb 2006
NOTES Edited by William Adkins arxiv:math/666v3 [math.nt] 25 Feb 26 A Short Proof of the Simple Continued Fraction Expansion of e Henry Cohn. INTRODUCTION. In [3], Euler analyzed the Riccati equation to
More informationUniversity of Alberta
TheGraphIsomorphismProblem University of Alberta ScottFortin by TechnicalReportTR96{20 July1996 DEPARTMENT OF COMPUTING SCIENCE The University of Alberta Edmonton, Alberta, Canada theory,canbebroughttobearontheproblem,andyetonlyforspecial
More informationOwner of the content within this article is www.isaserver.org Written by Marc Grote www.it-training-grote.de
Owner of the content within this article is www.isaserver.org Written by Marc Grote www.it-training-grote.de Microsoft Forefront TMG How to use SQL Server 2008 Express Reporting Services Abstract In this
More informationYou should see the following screen when you first login to Student E-Service
You should see the following screen when you first login to Student E-Service Check your status at the bottom of the screen. It should read Ready to Register Online You will find useful information in
More informationNew York Workers Compensation Trends
New York Workers Compensation Trends June 2015 Oliver Wyman QUALIFICATIONS, ASSUMPTIONS AND LIMITING CONDITIONS This report is for the exclusive use of the Oliver Wyman client named herein. This report
More informationInteger Factorization using the Quadratic Sieve
Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give
More informationDL.2009 Links Between Research and Experimentation: Use Case for FIRE Testbed
Networking for Communications Challenged Communities: Architecture, Test Beds and Innovative Alliances Contract no: 223994 DL.2009 Links Between Research and Experimentation: Use Case for FIRE Testbed
More information802.1X AUTHENTICATION IN ACKSYS BRIDGES AND ACCESS POINTS
APPLICATION NOTE Ref APNUS004 rev. A-0, March 08, 2007 802.1X AUTHENTICATION IN ACKSYS BRIDGES AND ACCESS POINTS Why? In addition to MAC address filtering, ACKSYS products support a more reliable authentication
More informationWiMAX System-Level Simulation for Application Performance Analysis
WiMAX System-Level Simulation for Application Performance Analysis Krishna Ramadas Venturi Wireless kramadas@venturiwirelesscom Raj Jain Washington Univ in Saint Louis Saint Louis, MO 63130 Jain@wustledu
More informationOperating Instructions (For User Authentication)
PLAIN PAPER FACSIMILE Operating Instructions (For User Authentication) Appendix General Description Using Machine Setting Machine The following trademarks and registered trademarks are used throughout
More informationAFDX networks. Computers and Real-Time Group, University of Cantabria
AFDX networks By: J. Javier Gutiérrez (gutierjj@unican.es) Computers and Real-Time Group, University of Cantabria ArtistDesign Workshop on Real-Time System Models for Schedulability Analysis Santander,
More informationHW2 Grade. CS585: Applications. Traditional Applications SMTP SMTP HTTP 11/10/2009
HW2 Grade 70 60 CS585: Applications 50 40 30 20 0 0 2 3 4 5 6 7 8 9 0234567892022223242526272829303323334353637383940442 CS585\CS485\ECE440 Fall 2009 Traditional Applications SMTP Simple Mail Transfer
More informationHow to Build an Effective Mail Server Defense
How to Build an Effective Mail Server Defense A multi-stage approach to securing your email communication August, 21 2006 Author: Alin Dobre, Head of Customer Support, AXIGEN GECAD Technologies 10A Dimitrie
More informationNetwork Security. Introduction. Università degli Studi di Brescia Dipartimento di Ingegneria dell Informazione 2014/2015
Network Security Introduction Università degli Studi di Brescia Dipartimento di Ingegneria dell Informazione 2014/2015 Objectives - Syllabus 2 Objectives Introduce the key aspects of applied network security,
More informationMARSHALL UNIVERSITY BOARD OF GOVERNORS Policy No. AA-4 MEASLES AND RUBELLA IMMUNIZATION POLICY
MARSHALL UNIVERSITY BOARD OF GOVERNORS Policy No. AA-4 MEASLES AND RUBELLA IMMUNIZATION POLICY General. 1.1. Scope. These rules promulgate policy and procedures regarding the requirement for measles and
More informationCOMP 361 Computer Communications Networks. Fall Semester 2003. Midterm Examination
COMP 361 Computer Communications Networks Fall Semester 2003 Midterm Examination Date: October 23, 2003, Time 18:30pm --19:50pm Name: Student ID: Email: Instructions: 1. This is a closed book exam 2. This
More informationq Connection establishment (if connection-oriented) q Data transfer q Connection release (if conn-oriented) q Addressing the transport user
Transport service characterization The Transport Layer End-to-End Protocols: UDP and TCP Connection establishment (if connection-oriented) Data transfer Reliable ( TCP) Unreliable / best effort ( UDP)
More informationEstablishing IP Connectivity to the Ez400
EZ-400 VIVARIUM controller IP CONNNECTIVITY guide 1.0 1 Establishing IP Connectivity to the Ez400 The Ez400 can be connected to a computer network, or an individual computer, via it s IP (Internet Protocol)
More informationTechnical Note. Monitoring Ethernet Traffic with Tolomatic ACS & Managed Switch. Contents
Monitoring Ethernet Traffic with Tolomatic ACS & Managed Switch Contents 1. Introduction...2 2. Equipment...2 3. Software...3 4. Definitions...3 5. Procedure...3 6. Change PC IP Address...3 7. Network
More informationLoad Balancing Oracle Application Server (Oracle HTTP Server) Quick Reference Guide
Load Balancing Oracle Application Server (Oracle HTTP Server) Quick Reference Guide v1.1.0 Oracle HTTP Server Ports By default Oracle HTTP Server listens on HTTP port 7777 and HTTPS is disabled. When HTTPS
More informationECE 697J Advanced Topics in Computer Networks
ECE 697J Advanced Topics in Computer Networks A Course on Network System Design Fall 2003 Tilman Wolf 1 Welcome Who am I? Tilman Wolf, Assistant Professor in ECE Office: KEB 211C Email: wolf@ecs.umass.edu
More informationConfiguring the Juniper NetScreen Firewall Security Policies to support Avaya IP Telephony Issue 1.0
Avaya Solution & Interoperability Test Lab Configuring the Juniper NetScreen Firewall Security Policies to support Avaya IP Telephony Issue 1.0 Abstract These Application Notes describes a procedure for
More informationA.1 NAME AND ADDRESS OF APPLICANT AND CONTACT PERSON... A-1 A.2 PARTICIPANT INFORMATION... A-2 A.3 CORPORATE INFORMATION... A-2
EXHIBIT A APPLICANT INFORMATION OAR 345-021-0010(1)(a) TABLE OF CONTENTS A.1 NAME AND ADDRESS OF APPLICANT AND CONTACT PERSON... A-1 A.2 PARTICIPANT INFORMATION... A-2 A.3 CORPORATE INFORMATION... A-2
More informationUsing MIS 3e Chapter 6A Appendix
Study Questions Using MIS 3e Chapter 6A Appendix How the Internet Works David Kroenke Q1: How does email travel? Q2: What is a communications protocol? Q3: What are the functions of the five TCP/IP-OSI
More informationWharf T&T Limited DDoS Mitigation Service Customer Portal User Guide
Table of Content I. Note... 1 II. Login... 1 III. Real-time, Daily and Monthly Report... 3 Part A: Real-time Report... 3 Part 1: Traffic Details... 4 Part 2: Protocol Details... 5 Part B: Daily Report...
More informationA PPENDIX G S IMPLIFIED DES
A PPENDIX G S IMPLIFIED DES William Stallings opyright 2010 G.1 OVERVIEW...2! G.2 S-DES KEY GENERATION...3! G.3 S-DES ENRYPTION...4! Initial and Final Permutations...4! The Function f K...5! The Switch
More informationHow to configure Exchange Smart Host
How to configure Exchange Smart Host In Exchange 2003, it's possible to configure a smarthost on the Default SMTP Virtual Server but, if you do it this way, you can only set a single smarthost. The preferred
More informationSUBCHAPTER 32M - APPROVAL OF NURSE PRACTITIONERS
SUBCHAPTER 32M - APPROVAL OF NURSE PRACTITIONERS 21 NCAC 32M.0101 DEFINITIONS The following definitions apply to this Subchapter: (1) "Approval to Practice" means authorization by the Medical Board and
More informationWorking Instruction Template. Instructions for Archiving of Essential Trial Documents at Datatron Off Site Facility
Working Instruction Template WI number: WI full title: WI-JRO-001 Instructions for Archiving of Essential Trial Documents at Datatron Off Site Facility WI effective: 28 th October 2013 Review date: 28
More informationSupported Platforms. Supported Standards, MIBs, and RFCs. Prerequisites. Related Features and Technologies. Related Documents. Improved Server Access
Configuring Timeout, Retransmission, and Key Values per RADIUS Server The Configuring Timeout, Retransmission, and Key Values per RADIUS Server feature extends the functionality of the existing radius-server
More informationSpecific Gravity, Moisture Content, and Density Relationship for Wood
United States Department of Agriculture Forest Service Forest Products Laboratory General Technical Report FPL-GTR-76 Specific Gravity, Moisture Content, and Density Relationship for Wood William T. Simpson
More informationFIFO Queuing of Constant Length Fully Synchronous Jobs
FIFO Queuing of Constant Length Fully Synchronous Jobs Vandy Berten, Raymond Devillers and Guy Louchard Département d informatique, CP212 Université Libre de Bruxelles B-1050 Bruxelles, Belgium {vandy.berten,rdevil,louchard}@ulb.ac.be
More informationProjector Monitoring Software
Projector Monitoring Software Ver. 1.0.0 User s Manual Introduction "Projector Monitoring Software" (hereafter referred to as "this software") is a software that uniformly manages network-connected compliant
More informationState Electricity Price Forecasting Model Summary
State Electricity Price Forecasting Model Summary Contents SUFG State Electricity Price Forecasting Models... 2 United States Census Regional Division Map... 3 Forecasting Results Comparison (Annual Compound
More informationTelecommunications Advisors Since 1962. March 24, 2014. Via ECFS
7852 Walker Drive, Suite 200 Greenbelt, Maryland 20770 phone: 301-459-7590, fax: 301-577-5575 internet: www.jsitel.com, e-mail: jsi@jsitel.com March 24, 2014 Via ECFS Marlene H. Dortch, Secretary Federal
More informationAlok Gupta. Dmitry Zhdanov
RESEARCH ARTICLE GROWTH AND SUSTAINABILITY OF MANAGED SECURITY SERVICES NETWORKS: AN ECONOMIC PERSPECTIVE Alok Gupta Department of Information and Decision Sciences, Carlson School of Management, University
More informationSIM800 Series_IP_Application Note_V1.02
SIM800 Series_IP_Application Note_V1.02 Document Title SIM800 Series_IP_Application Note Version 1.02 Date Status Document Control ID Release SIM800 Series_IP_ Application Note_V1.02 General Notes SIMCom
More informationRevisedJanuary26,1996. 1
EarliestEligibleVirtualDeadlineFirst:AFlexible andaccuratemechanismforproportionalshare DepartmentofComputerScience,OldDominionUniversity ResourceAllocation IonStoica,HusseinAbdel-Wahab fstoica,wahabg@cs.odu.edu
More informationTransport Layer Services Mul9plexing/Demul9plexing. Transport Layer Services
Computer Networks Mul9plexing/Demul9plexing Transport services and protocols provide logical communica+on between app processes running on different hosts protocols run in end systems send side: breaks
More informationA Passive Method for Estimating End-to-End TCP Packet Loss
A Passive Method for Estimating End-to-End TCP Packet Loss Peter Benko and Andras Veres Traffic Analysis and Network Performance Laboratory, Ericsson Research, Budapest, Hungary {Peter.Benko, Andras.Veres}@eth.ericsson.se
More informationCSE 123: Computer Networks
CSE 123: Computer Networks Homework 4 Solutions Out: 12/03 Due: 12/10 1. Routers and QoS Packet # Size Flow 1 100 1 2 110 1 3 50 1 4 160 2 5 80 2 6 240 2 7 90 3 8 180 3 Suppose a router has three input
More informationARTICLE IN PRESS. European Journal of Operational Research xxx (2004) xxx xxx. Discrete Optimization. Nan Kong, Andrew J.
A factor 1 European Journal of Operational Research xxx (00) xxx xxx Discrete Optimization approximation algorithm for two-stage stochastic matching problems Nan Kong, Andrew J. Schaefer * Department of
More informationIntroduction to FileWave
Introduction to FileWave Modern Systems Management LeRoy Dennison Training & Certification Manager LeRoy@filewave.com Ben Byers Systems Engineer Ben.Byers@filewave.com What is FileWave? Since 1992, FileWave
More informationL a h ip e r t e n s ió n a r t e r ia l s e d e f in e c o m o u n n iv e l d e p r e s ió n a r t e r ia l s is t ó lic a ( P A S ) m a y o r o
V e r s i ó n P á g i n a 1 G U I A D E M A N E J O D E H I P E R T E N S I O N E S C E N C I A L 1. D E F I N I C I O N. L a h ip e r t e n s ió n a r t e r ia l s e d e f in e c o m o u n n iv e l d
More informationC o a t i a n P u b l i c D e b tm a n a g e m e n t a n d C h a l l e n g e s o f M a k e t D e v e l o p m e n t Z a g e bo 8 t h A p i l 2 0 1 1 h t t pdd w w wp i j fp h D p u b l i c2 d e b td S t
More informationOn-the-fly Model Checking of Fair Non-repudiation Protocols
On-the-fly Model Checking of Fair Non-repudiation Protocols Guoqiang Li and Mizuhito Ogawa Japan Advanced Institute of Science and Technology Asahidai, Nomi, Ishikawa, 923-1292 Japan {guoqiang, mizuhito}@jaist.ac.jp
More informationHow To Secure A Website With A Password Protected Login Process (Www.Siphone)
Preventing Spoofing, Phishing and Spamming by Secure Usability and Cryptography ICDCS 07/07/2006 Amir Herzberg Computer Science Department, Bar Ilan University http://amirherzberg.com 04/05/06 http://amirherzberg.com
More informationTCP TCP UDP. 1. It is impossible to connect clients to the equipment connected to the PC COM port via Wi-
Instructions for Controlling KNX/EIB Equipment via the Internet Operation via the Internet allows you to control the equipment of the KNX/EIB bus when being out of the local network of your automation
More informationSubject: Remote Working
GREATERLONDONAUTHORITY LONDONASSEMBLY Subject: Remote Working Report Number: 5 Report to: Business Management and Administration Committee Date: 11 March 2008 Report of: Head of Paid Service 1. Recommendation
More informationInvestment Management System. Connectivity Guide. IMS Connectivity Guide Page 1 of 11
Investment Management System Connectivity Guide IMS Connectivity Guide Page 1 of 11 1. Introduction This document details the necessary steps and procedures required for organisations to access the Homes
More informationDesign and Implementation of Distributed Process Execution Environment
Design and Implementation of Distributed Process Execution Environment Project Report Phase 3 By Bhagyalaxmi Bethala Hemali Majithia Shamit Patel Problem Definition: In this project, we will design and
More informationComputer Networks. Chapter 5 Transport Protocols
Computer Networks Chapter 5 Transport Protocols Transport Protocol Provides end-to-end transport Hides the network details Transport protocol or service (TS) offers: Different types of services QoS Data
More informationSIM800 Series_SSL_Application Note_V1.01
SIM800 Series_SSL_Application Note_V1.01 Document Title: SIM800 Series_SSL_Application Note Version: 1.01 Date: 2014-06-30 Status: Document Control ID: Release SIM800 Series_SSL_ Application Note_V1.01
More information() XCP-i: explicit Control Protocol for heterogeneous inter-networking November 28th, of high-speed 2006 1 networks / 15
XCP-i: explicit Control Protocol for heterogeneous inter-networking of high-speed networks Dino LOPEZ 1 C. PHAM 2 L. LEFEVRE 3 November 28th, 2006 1 INRIA RESO/LIP, France dmlopezp@ens-lyon.fr 2 LIUPPA,
More informationGroup Life Insurance. Massachusetts Board of Higher Education STANDARD INSURANCE COMPANY
Group Life Insurance Massachusetts Board of Higher Education STANDARD INSURANCE COMPANY Group Life Insurance Answers to your questions about coverage from Standard Insurance Company About This Booklet
More informationDynamic Load Balance Algorithm (DLBA) for IEEE 802.11 Wireless LAN
Tamkang Journal of Science and Engineering, vol. 2, No. 1 pp. 45-52 (1999) 45 Dynamic Load Balance Algorithm () for IEEE 802.11 Wireless LAN Shiann-Tsong Sheu and Chih-Chiang Wu Department of Electrical
More information1 9 / m S t a n d a r d w y m a g a ń - e g z a m i n m i s t r z o w s k i dla zawodu M E C H A N I K P O J A Z D Ó W S A M O C H O D O W Y C H Kod z klasyfikacji zawodów i sp e cjaln oś ci dla p ot r
More informationThe New Zealand Security Intelligence Service Amendment Bill
Government Bill Explanatory note General policy statement The implements Government policy decisions to update the interception warrant framework. Amendments are required to update and clarify the Service
More informationNETWORKS AND THE INTERNET
NETWORKS AND THE INTERNET Outline to accompany the slide presentation 1. Networks and the Internet A Primer for Prosecutors and Investigators 2. Getting There From networks to the Internet Locating a place
More informationShould the IETF do anything about DDoS attacks? Mark Handley
Should the IETF do anything about DDoS attacks? Mark Handley The Problem The Internet architecture was designed to delivery packets to the destination efficiently. Even if the destination does not want
More informationAre Second Generation Firewalls Good for Industrial Control Systems?
Are Second Generation Firewalls Good for Industrial Control Systems? Bernie Pella, CISSP Schneider Electric Cyber Security Services bernie.pella@schneider-electric.com Firewall Overview Firewalls provide
More informationCommunicating Systems
Communicating Systems with UML 2 Modeling and Analysis ofnetwork Protocols David Garduno Barrera Michel Diaz LEEJTEE WILEY Table of Contents Preface xi Chapter 1. Why Use UML to Model Network Protocols?
More informationState Policy Report #48. December 2013. FQHC Reimbursement for Telemedicine Services in Medicaid
FQHC Reimbursement for Telemedicine Services in Medicaid State Policy Report #48 December 2013 Telemedicine (or telehealth) is the remote delivery of healthcare services and clinical information using
More informationExtracting a Print Capture From a Network Packet Capture Using Wireshark White Paper
07/26/2010 Technical Information: Extracting a Print Capture From a Network Packet Capture Using Wireshark White Paper Document Version 1.0 Copyright 2010 RICOH Americas Corporation. All rights reserved.
More informationPARAPROFESSIONALS: The 411. Chandra Martin, Public School Program Advisor Arkansas Department of Education
PARAPROFESSIONALS: The 411 Chandra Martin, Public School Program Advisor Arkansas Department of Education What is a Paraprofessional? From the Title I Perspective: An employee who has instructional duties
More informationCost-Effective Certification of High- Assurance Cyber Physical Systems. Kurt Rohloff krohloff@bbn.com BBN Technologies
Cost-Effective Certification of High- Assurance Cyber Physical Systems Kurt Rohloff krohloff@bbn.com BBN Technologies Most Important Challenges and Needs Need dynamic behavior in high-confidence systems,
More informationW 2: Subminiature photoelectric switch series: extremely small and extremely strong
Photoelectric proximity switches BGS Photoelectric proximity switches energetic, (V optics) Photoelectric reflex switches Through-beam photoelectric switches W : Subminiature photoelectric switch series:
More informationA NEW APPROACH TO ENHANCE SECURITY IN MPLS NETWORK
A NEW APPROACH TO ENHANCE SECURITY IN MPLS NETWORK S.Veni 1 and Dr.G.M.Kadhar Nawaz 2 1 Research Scholar, Barathiar University, Coimbatore, India venii_k@yahoo.com 2 Director, Dept. of MCA, Sona College
More informationMetasys Historical Data Visualization
Installation Bulletin Issue Date 11/01/01 INSTALLATION BULLETIN Metasys Historical Data Visualization Metasys Historical Data Visualization...2 Introduction... 2 Key Concepts... 3 Overview of MHDV Configuration
More information