Introducing Petri nets M. Silva 14 INTRODUCTION Moe maniactrng spies ae highly paral and distributed. They Ded to be aaaoed ‘oom quale and qoattaive points of Vew. ‘ualatve analy looks for properties ike the absence of deadlocks, the ‘Seenot of (tore) overows, or he presence of era tual exclusions inthe ue of shared reourecs (eg, 1 robs). Is uimate goal ito prove thecometnest of the modeled sytem. Quanittve anal looks fo: pe famance properties (eg ought), esponsiveness propets (ef Ne ‘ge completion tne) ov ilizstionproperics (eg average que engthe ‘rotation ates. Tn other won, the quantitate ana concers the ‘Shluation of de ediceny ofthe modeled sytem. "Asin many engineering eld, the design of manufacturing stems can te cared out sng modes. Pett acts allow the consruction of models tineable both fr soreence ad eftseney enya. Moreover they ean ‘implemented using many diferent technigues (Bardwste, mito Proprammed, software). Because ofthe graphical nature of nt model, {hey ae mow seltdocamented specifenton, making ease the commun Seaton among designers and wae Net models can be wed during the tate ie oye of mamtactring ster "A Bot et (PN), ike dierent] equstioa, a mathematica formal Jum, Pa ets ind hes basis in afew supe objets, relations and ues, {et can epreseat very complex hehavior, More presly, Pt bes can Teconsdered asa graph theore oo specially se to modal and analyze secrete event dynamic ystems (DEDS) which exh paral evlutions nd whose tehnvors ave characterized by sjachronization and sbaring Dhouornens. Ther suabity for modeling the txpe of tem hat led ‘het applsation laa wide range of els, Examples of such DEDS ate commuricstion setwors, computer syscms ad he purpose of his hook, ‘@scete part manufacturing eptems To beable toe Pet net for modeling a given spe of application, ‘we must enrich it with an adequate interpretation. That i, we must associate2 Invoducing Petr ness semantics (Le ‘physi’ meaning) tothe net's emits (paces, tans tion, tokens), evolution conditions thd, eventual. define the actons eveated bythe evoltons Bron speaking the lterpreation gives ‘ean othe et system and defer is reltonhips withthe external Sold (the interpretation coatiders the environment in which the et ‘ode wil be exessed), “The lncerpretation of graph thotei took is nothing sew. A. raph Gots ehoretial sense) ia set of objet (nodes) with relaons se, for txample, Deo (1974, Gibbons (1985). With graph the conoctity Isweon sites (owns, pints in a co.) can be represented ing slut interpretations Another kind of interpretation on graphs slow ‘sto model discrete and Hine dyasmic systems the nodes represen the Sates of the tem, te acs represent tnsiions between ste. Pa ticlcnng ile moce the eate-aee nteresstion, tte diagrams (SD) (se. foresumple, Brecdng 198), and tate tansion grams (STD) sce for example, Ajtone eta. (1987) are widely ed interpreted. raps ‘SDs alow te modeling of anit sate sequential witching seems, wie ‘STDs allow the modeling of homogencous faite Markov chains Fer both formalise, SDs and STDs, the evolion o the sem canbe done ie ‘continuous time (asynchronous state diagrams, sate ranstion sate da {grams} or in rete ime (syncronows state graphs, cet time ate fematon degra). ‘Provided with adequate interpretations, PN are able to mode ‘in ‘wlouted state diagrams the consol flow a concurrent program oF qe Ingnetworks wih synchronization, moog oer poses The evasion of fully unierpreted net stem is sud to be autonomous. Aa incr preted net system f said To be nom-antonomows Decauees evoition ‘pend alto onthe tate ofthe environment considered bythe asociated Interpretation For example, the timing of ne ik paraleiterpre tation by which evoltion depends sso oa ine. “There exits very ich ody of knowledge around Pet nets theory and sppleatons The purpose ofthis chapter eto ily orev in «2 {nal ad estate wy the base mdcing concep ad te mai ech igus for qualitative naa. It ex bo si that Petr nets ae sated for pall seems even more thn ate avtomat for sequent tems Any ow the main practal argument for employing PN oad te the we ‘graphical, easy to understand singe fay of formalzs throug al he ‘ferent stages from the design sot the implementation and operation ‘Although tan recent resus are aterated inthis et the main ne of agument closely flows Siva (985). The chapter sbasaly organized In two parts The fst on (opto secon 1) devtned to ferent odelng ‘sues Th second pa etions 16 and 17, maialy devoted io quai te ands More precisely, the chapter is stucused as follows. Net ‘feructure and the dyoamnics of net systams arc introduced io section 12. [Nets and net systems 3 stra way som posible interpretations of et sstoms model. The Uastace of patolopeal bevy 0a concurrent stems Jad to the PESition ot some Disks qualtaive properties in rection 1S. Their ia dove im seton 1, ovevewing Teschablty raph (ection wary ne sjtem redatons (ection L62) snd liner algebra techniques [edlon 1.63), Section L7 is devoted to some base net sabelases and (Stats. Obviocely, te more rstzlned the nx subclass tbe more imerfl te analyse tchaigus ate. Conlding and biographical re send thi itoductory presentation 12 NETS AND NET SYSTEMS [A ets net model of dynamic system coasts of to parts inet strate weight bipartite directed graph, that repeesent the Sate part ofthe system; and 2b muking. representing dtbeted overall state onthe structure ‘Te above seprition allows one to reason on net-based models at to diferent levels stracaral and Behavioral, Reasoning tthe stuctral fovel we cat deriv some fst copcasont onthe bebe of he mods ‘sem, relting when pose structural ad behaioal properties. Purely Behavioral reasoning ate computational very complet 2A Net strucre (what Pete net?) “To model «dicret-vent- dynamic sytem we need 1 take into account ie sates andthe event leading othe stateavotons. a et stems the nei dened by means of tof state yarns represeating load sonditions. Moreover, net models make explit the existence of stte- trans Therefore ot trues ae bit onto dsj sof objects places (copreseated ae sires, and traneons (represented as bats or bose) ces are the suppor of the sate variable Placer and tanations are related through 2 weighted Sow relation, cseribed by a0 unweighted fw relation, F and a weighting function ox FW. Let sow ghe he formal defations and soe some examples Definion LA. A Petr met it for-tupe: N=@.TEW) where P is ite non-empty set of = /P placet Tis finite non-erapy set of y= (7 transitions PAT; Le laces and wansons se dla sts F.C(Px 1) u (Ix P) i the ow relation (et of directed arc4 i gue LL Net secure and nett (9) N, nt ures; (0) (NM en. Figure 1.1) shows a net structure, Ars are labeled wit tural nue, low or Wp), rene, A wb n0aiy a eg ‘low ts to mode! bulk ava or balk services, BY convention ualaeled fs are weighted one. Al the are weights inthe eet of Fig 11 ae 2, xcept for arc (6?) and (py d) whose weights ure 2 In many practical ‘set there exists ltr bulk srl nor Bale serie, Therefore ll he ‘Se weight te age. In ths ase th ne sa 0 be ondary, ‘A place p isan iput (output) place of waniion i thre ees are ging from pt (oatpet respectively tom op) Ia ig. 1, Ln ne Input places of d while (pp) are output places ofa “Aa alternative may to see Per pes i to dine the weighted fow elation through wo bncdence fancon: Definition L.1(a). A Pet nti four tpl: = (.T.Pre Post) ere P and T are disjoint, ite, nonempty sts of places and tanons, respectively ‘Pre: Px T+ Nis the pre-incldence or inpat function [Nets and net systems 5 gee 12. Two sloop “Tote tan ar going fom the place p10 the tension gift Pre( pt) * 1 aly, there ean ee png Kom tansion ito plac pif Past p) The are weit Pre(pes) = M291) ot Post p) = Wp) dels ‘Ge corespooding as The pre-and posse! oftansion F< Tare defies revgecely t= (p | Pre(p.o)> 0) and ¢ = (p | Potp) > 0. The pre- [nd postac ofa plac p © Pare dened respectively a8 'p = Ponte) Soya p= Prep. > 0 {A praca way of represenng the act swuctue Isto use Seldence maces Th incidence futons canbe represented by meaas of pre at nce matics, Pre- and Post both having = IP rows 8nd m= Tresumas. "The pe” aod pos icidence matrices of the net Fig 1) are as abedes abedes a(Loo000 a(oooro0 plo1oc000 ml200000 boo200 plo1oo00 ren lo01010 Pou- 5 }1 00001 Biooo100 ploo1000 plooooor ploooo10 Apr of lice p and transition scale selon fp i both an inp nd outpet pace of A Pet nt mai to be pure thas no eos "Figure 12 shows two sltloops A sloop can be easly eliminated (easby expanding the tanton ico sequen: nal ransom ~inter- ‘eats plac fal rasta) Pure nes ae completely characterized by the (Single) incidence mae: C= Post Pre Postve (negative) entries in C represent te post (pre) incidence fune- tion. Ifthe net isnot pure, the icdence matrix ‘doesnot se" the sel- oops. 122 Net systems marking and token game “The structure of a net is something static. Assuming that the behavior of6 Inaroducing Petri net lewe 13. Fig anion © making vlna, ynamics of a net structure are created by detning its marking and ‘marking evolution rae Definition 12. The marking M of» net Nisan application of Pon Nie the aigatent of a non-negative inter (aur of tokens) to ech place Definition 13. A mated Pets net or net tem isthe couple (N, srhere N's Pet et abd My roms masking ‘The number of oes at ple epesens th tate othe pla (Le the sve ofthe sate table). The sate of the oretell act sytem Geinat by the calecon of local sates of the plses. A making M 8 ‘Send a nin = vector whowe pts compose, M(p), epreset the ‘pimber of tokens in place The vector M tho state-ecto of the di ‘rte event dynamic stent deserbed ty the act sytem. orally, we Dis ip ak dot (uc ne cv regen Rae Eto repens ance wi nina mashing so ‘Once le dsibuted sat dened the gurston how cor 4 net system work? The evolutions dtd hough sing o occurence re, [oomally named the token game Tis because net etre en De een pel checker the tens sa her and thea aes the ‘Gone ele. Trantion eprsent potential mores ia the aten ge Deion 14 (ken game). A marking in net wystem evolves second {ng to the tllomiog fring (or eerarence) rae 1. A tration ald tobe enabled at a ven marking if Pre) an 2 Denoting as) My he fat that M, i reached by fring a. (M, bles Myx M+ Post) ~ Pre) = M+ C10 2) Aseuing N to be pur (thers it can be easily tansfonned), itis not Gite to derive the folowing Mi) Mo Moe Mit Coe, 20 a) here «tthe characte vector of) =H = 1 hen 1 else 0 "The rghchand side of the equivalence in eq. (13) i dearly a state yuan the present sate, M, the meat sss the input vector. ‘Mornay classe cool theory i aot of reat hep to ux when Studying the dynamic beavior of aot estes the tte (marking) sed {npyt vector should ake her values on non-aegatie integers Tnterating the sate equation fom M, along = Brg sequence = gs leading 10M, (My i fob reached from Ma By pears of) we Mo) M,= My = Mot C7 20, 8 20 as vebere 2 i he rng count vector of: (ste mum of tines has Bren Sed in "Egtation (14) called the fundamental eqeaon or, moce frequently, ‘beste equation of the nt eit (Remar: prope specking te sate ‘equation eg (1.3), whale oq (14) tthe talon eqeation in coat {Beary teindogy) The moet important retnark nw is that only he right-hand piston sit in 9. (0, Orherwise state, unfortunately a nowaepave iteget foluion 3S Dot My = ys C2 doen not imply there exists 8 such that My reachable om My (le. des aot imply Mia) 34). For ‘caarmple, assuming M; ~ 0 for the net la Fig, 11(2), @ = (1.1,1.1,0,0)"8 Inroducing Petri nes latoger coupe M, = 0, = (1.110.097 called spenons olaton of the state equation. The existence of sparious solutions she main problem for the anahals of net systems sig near algebra feciqus However, ‘any paca analy reals caa be obtained using these tetnques we Intersections 163 and 172) 13. ON MODELING FEATURES, et net, a8 itroducd thar fr, ave mathematical foals, This fection presents a amber of features which i our opinion ~ make nets Sn interesting modeling formalin, spcily suited for dscrete-event ‘ynamic systems With concurrent or parallel events and activites. "The consderaoas in thi section ee genera est on te abstract onmmis vai for ay paisa nterpettion. Before concentrating ox ‘Surman beue her, om practi! modeling, sport to highlight the fact that nts alow anal graphed rpeescataton that makes them ery tach appreted im engineering cies (pice i wor a thousand tron") Nevertels, ig and not wel-stactred net models re dful To understand and analy. This means in practice that good modeling tdacitines ae very smpertant. "AS a preliniaay temack on practical modting, te fader can easly check este cf representing with net tzee base modeling noon ‘cal dependence (eg. sequence), colt (Geisa, choise) and com ‘arene. Gong back bourne sem in ig 11(b) is obvious that he ‘ting of fmt be done efter (usl dependence) that of. Als, itis lear that twice band emus pecece the Bag of. Moreover, cand «deine 2 one. From aay marking wth Bp.) ~ 1, anstions e and ate Saultnsotly enable, but they cxmnat be simultaneously Sed: a de Son su solve the conti. "Ae slrendy mentioned, «major feamre of es is that they donot define in any way bow and when (eine independence) a given confit should te acody eaiag fo no-detrminkn om Behavior Sequence and conft are clascal notions in sequential stems (8. sw ite sutomata). Concarreney sad concpe that at systems re Present in an extremely natural Way. Informally speaking two tans ‘oe are oncarent at + gten marking if they canbe aed athe same tine, te simullancously. Once Ganson ais red i the net system at Fie. 11), the marking M = (0,2,0,1.0,0,0% is reached. Then trans tions b and’ ean be fred simitaneoy. Moreover, Beaute MP») 2 tranaion b canbe fred concurrent to self (ea of Fe-eateaney etconeatrency ‘Syacronzations are very important i the modelag of dsubuted and TUTE Siatemn. How tse Umchronizations modeled with net? Basi- “@ opronen pe ye atl el lta) some ooee (2: 0) gua coon red). i : 4 oo ‘leommette RVscnapbre (nate) ewe 14. ‘Type ynhiniantion schemes: ( ton10 Inducing Per ness may spent, even i tention as only one inp pice when the ae ‘Teak (eg stmingp, wae not presen in Fag. 1, tasiion d would [Mo represent asynctonzation Beene i fring would requ the res nce of to tokens 00 P). Figure 14 is eelt-esplanatry Ia all cases nots are ordinary (thus syncronization are om tration wih more than one inpat place) Jost two seas (I) the correct behavior of schema (0) is based om the fact thet bath and p cannot be smaneaaiy marked (they must be in Imuoua excaton) and 2) the resource tof scbers (g) canbe wed in ‘lace pon place py but setaneooe wei posible Ge. the we in Daand pis a util excasion). The soparation in a bipartite sracture and 2 marking makes tbe net based approach very powerful for modeling puspeses. In particular, the Uishocomy plcefanations lade to a tretnen of tater and actions on {Sr equlfosing “Tie nat ~ in er opinion ~ nets superior to either purely state or purely tunsion rested formaliaes where one of the ‘otion ir expt and the otber bas tobe deduced. "The extence of leafy principle on sie and actions (anstons) inet ods det conrequoee ot bipartite suuctre and marking ‘efnison The impormce ofthe locatypiaciple resides the fac tha ‘etiodels can te lncaly mie, refined or made couse, without aketing {he ret of te model Ths mas in parla that net can be syathested Tsing lopown and bottoneap approaches Top-down syubess i any procedure that sting with a nl (very abstract) model, leads tothe Fal model through stepwise refinements. In 2 bostom-up approach tmodals se prodced por in paral by diferent groups of signers, nd later composed. Restricting the many posible referents and com postions steps we ut elon here pace an traonrelnemens End compastons through mersng of transtons (Le synchronization of ‘modales) and merging of places (ve. fasion of modules). The et in Fg 15 ‘hows twovel Meare efisementp, (ht defies local stats) end (ae reiaed. The net stem ia Fig 11 can be oblaned synchronizing to mules (Fg 1 eng weancions a and 4 o fog 0 ‘dale (ig. 160) fing the places.) Summarion, silat aa abstract lve, net tems have the flowing pret featres for modeling 1. Graphical and equation representations. Therefore, net systems ‘joy sme comparstve advantages for documentation and analy ‘adie ‘Natural expression of causal dependences, confits and coneumene. Simple, appealing sod powerful ymehrenization mechaaian making tral the contraction of muteal eehon costes ne ee eee aad tations which allows the Mlerenchical and the On modeling feaures u Fer 16 Two mdr way of oman the tin ig 1: (6) hoe Bagwe 16 Two w ) eynchec2 Inuroducing Petri nes SYSTEM SNVIRONMENT igwe 17 Nose tem and enon mata neat 14. ON NET SYSTEMS INTERPRETATIONS ‘A Pets ne canbe used to model aascrete event dynamic tems assign: figs meaning to is asouated elements (places, transitions and tokens) Shu tenting spb the modeled system and is environment (Fi 17) In general the behavior of system i influenced by the environment {through events n Our css), while the actions generated by Be sjstem {naence the behavior of fr environment Thetefore, to Interpret pet, ‘stem to esblahs convention which defies: 1. The messing of places, transitions ang tokens 2 Avmeaniag forthe conditions which govern the transition fring The masking evoation rue sghly modited by the interpretation, ‘thich a become a function of the Behavior ofthe modeled system's ‘vironment 3, The setions goncrted by the mod 1 te behavior of «net system snot ndaensed bythe environment, it Said to be mutomomoas, Non-stenomows net sytems ee ose con ‘Mined bebatior thas the underlying autonomous nt site, "The purpose of the informally writen section Is nt to Bx ‘good intr pretation butt show the existence of many posible ones, even for 3 [Bren clas of problems or spcason domain. Therefore, te veader sould fot be very much worsed about tecalcal deta, ‘Section Lf intodaces to diferest interpretations, ene for modeling the conta part of concent programs the vecond penalize the lsc sate diagram forma (ee, for exarple, Eropovas and Lang (1985), Breeding (1989) useful to model vequensal switching systems, To less ‘ieretate PNe at tminterpeted models fom Chet diferent interpre ee aE ee nee Tas voastcben diamums uxe the nemes elven ta. (On net systems interpretations 3 {AL Macking ow charts and marking diagrams ‘et model and vice vere. Usually the interaction s dove through (@) Events sodlorprdietes over some ‘external sate These ‘guard the fag of teapstions (fom the environment fo the net modeled sytem) () Aion that, generate by the net modeled sit, aut he sate of ‘he environment change’ Depending more precisely onthe aplication domain (software, hardware cattle logial automatisns ete), many interpretations exist Tn some (Goon scons ae srocated with ft fing of ansitone (arin Meal ‘Aesouns), in ether cscs ection are anocited with the tering of ‘laces (att Moore-Antomat) ‘Even fora given application domala thre exis many pose interpre- tions: Thus no formal orgs defaon of iaterpretations wil be give. Only two cas are considered fr ilration purposes. Fist there He ‘ callestoa of somments on what et interpretations look like 19 model the contol part of conearent software satems. Later 9 dire cent contr (a production cal with two tnahine, on robo and tts) pode sig making diagrams. (a) Marking ow chars In modeling vottware the more natural interpretation is based on the ‘Sse east prt (CP)-operalive part (OP) decorsposion. Using the OP decomposition prncple the sate ol s program (sequeatl ot ‘encurrent) ean be considered ss the conctenation of contol late (ot the CP) and a data state (fr the OP). Places wil represet ars ofthe Sontol tate (defined by the marking of the ne), while predates over the Sata state ar soit withthe trnsons, Preah low decons t be taken (1. conics to te soe). “Therslre the fring of tanstions is governed by the net msrking and predicates on the dita Duta wansformtion canbe associated with the lng of rast (sual implemented by means of sequential modules sctnte by the fig of the Wanstion). Fora given progam, the exceuton ofan instruction (at a more abstract, Jeyls block of instructions or module) wl be represented by the fring ‘fa tansaon. Th prensdence (ape) function ofeach transtion de- ‘eomines a condiion which must be fullled fr the lnsuuction (or the ‘lak to be executed In general, with each texston label, coasting os predicate over datas transformation’ couple, i associated. I 8 ‘transition {s not conditioned by a predicate, that fcld is omitted in the1“ Invoducing Petri nes eg Figure 14 How contol representation o single pure PASCAL he corresponding felt omit The complet condition for ing a tani ‘Son the intersection ofthe et sysem enabling condition and, possibly, the aacited prodiate over data. “according tthe above comments, at certs lovel of abstraction the injexprted net system model the control part. walle the operative partis Jimplemented though te modeler susoated withthe fring of ranstons. Figure 1 is pasta selesplanatory. (0) Merkin diagrams In modeling derete-event-contolers sate diagrams (se, for examp'e, reeporac and Lang (985); Breeding (198) age ascal interpretations of papbe allowing the modeling of alte sequential switching automata ih atate diagrams the nodes ofthe graph represent the wate, wee scene labeled wth exeroal events and external tate conditions, Actions ie asocited wih the traston (ec) or the sates (sodes) Eveatally cons may be soadiiooed by the extemal ste. State diagram inter Pretations an be ely apped to Pet net systems lead to some marking Soa eg nt Bet ctf xa eatin {aed the ring of twanstons, and ()acons canbe estocated wit a> Sitions(evekacdons) orto the mashing of places, Noe eee oy cngnr mamfarcorige domain through an example, (On ner systems interpretations 1s consumer (icant 2) schema with ¢ mutual excuson semaphore (R. robot) (ig, 19()). Many production sytems can be contracted con ‘nenating ferent sages of sack sche "The flowing behavior i mumed forthe cll (Fig, 19()). Raw parts ive though conveyer. The arial of part i detected by «presence (ee photoeecri) sensor: M,= 1 «pat peseat. When a pat & present, acon 1 aot loaded and the robo i fret prosede to load {he machine (loa: endo Jou), The machine performs operations 0, nd mats for depot inthe bao (na ep) "The depo done hen there san empty nice nthe baler and the robot fre span. Ead-ot epost, od, 8 fepresentd by a tansiton. xcs 2 proceds in an enlopous was, but ence op, bas Sash, 2p, (end ofp.) waits for the robot to pexfom the valouding, assuming the {Seva sear detec tha there i any pat tthe beganing of the nies pats conveyor (I= Of the conveyor fe) “The net stem model in Figure 1.0) (tus al these interpreted net modes marling grams) speaes tbe above tehuvior. Is abled With fernal conditions at tanstions (abel Tf, abel), and actions at places (oad, op, depos. op, load, withdrawal) 12 Timed met stem Uninterpreted Pot et do aot include any notion of ine and are aimed tormodel oa the logis! tehavioe of stems by desoubing the causal {elon exiting between eveus. The ineducion ofa tming Specie thn i eveatia if we want fo te thie cles of model to conser per fomance, shed or reaime conrl probes. “Timing ond fron procter Since Petr nets are pare graphs, itor cally there fave bow fo ways of tod the concept of ie is ther. ‘unl, asccaing a Ume interpretation with ether places or tansions ‘Beease Wanstonsfepreseat acts Ut change the state (marking) ofthe et seoms ‘natural t0 asocate durtion With these etitee {eanstion) In onder to salve conse between transitions many athort ‘end to define a "ied firing" oftansoos in three phase: fst Stantancous pase in which a enabled wanaion removes tokens fom is input places then + med phase a which the wansioos ae "working and nal igstantancoas phase io which takens are deposed into the output Paces. we want to model pre-empllow of aciues afr their arias. Fowever we are forond to aseciate aa enabling time with ansdons and ene atom iin, In ths way conics sould be solved atthe end ofthe ‘ay of enabled tremtions The solation is alveye i favor of the ist tansiion that eager fing Ume among the conics tuasions (jmone ea, 1989) Tn any care, from ¢he above discussion it follows that the only effect ofSi(@) hee gue 19 produce sl wth op ques, oe soot and tre: FRlatns iE atuning as) Net yoton opening the bebo (On net systems interpretations ” ot OS tothe diferent implications that the chices have on the reslation of confess. Tet ts ow pve in a more prece way two aeraive definitions for Aeterminiteally ined Pet net. The reader at to recto the fl tlcship between th oo. Forillorraion peroneal hee phases ied feng i now considered, Definition LS, A (deterministic) raniton ned Pet net (HTP) oouple (NZ) an that N= (PT Pre Pan and Z i fanetin which {signs a nonnegative real number, z, 1 each tansison inthe net 2:7 SUR = 210 i caled the Mtg tie ofthe wansion ‘Tae marking evoiton rule of e TPNs i esely identical to that of a FN, ‘The ony diferene hat firing takes = tine unis. Adopting the tree piss approach (Fig. 1.10: 1. When he trnston#itenble, fring inated. Conti are non- Acterminiiclly soved at io te uated net system. In this phe Prep.) tokens dsrppea fom each lap pace of 2. The firing proces (which represets an operation) resins fr z time 4 When the time wits have elapied eh Sriag ends ta thls phase Pout, woken ase added to each ouput place a Definton 1(b5). A (termina placeimed Pet Net (p-TPN) ‘sa couple (NF) euch that N= (PT, Pre, Port) and Ris a funtion which ‘scenes non-native real mer 10 each pce i he et RP > Re "R(p) the minim reidence tine of & Token inp, ‘A token ina p-TPN can te in ihe of two states: ready or not ready. TF ‘he token ae ready the marking evoliton rule the same as for an ‘otonomous get stem. NOt ready tokeas do not enable tanstions, a Thowgh they were tot present yt. When a token reaches «place, poes int the oa-eady sate, and becomes rey apn after an itera at Rp) ine nis In bavi timed PN models, confic resolution strategies are not specified:18 Inducing Peri ness Single vers maple server semaies: degree of sitconcurency. A posible sours of confision ithe defnkon of any fred net model i {elated tothe selfeoncurency (rre-enraee) of anstion. In the ese Dt timing ssccatd with ples, oom gui natural to define unavall- bly tne which is independest ofthe Cota suber of tokens aloud [rent in the pine. Thi can De interpreted as an nal server poly ftom the quewingtheary perspective. tn the case of tine astocatd with ttanstions the adopted Semantics less obvious. Assume that transition Fiekenabieg ats gvea marking, Then eter ooe fring of cosets that ‘ine or sings oscurin pall (the idea of ene ox more serve). "Ts single server and inte server Semantics can be considered in teansdon‘tmed net model. OF couse an infinite server tanston can tinays be comnrained toa “server Behavior by just adcing a sloop place around the tanton (Lean input and oxspet pcs wth tokens (Gee he self doo place in Fig. 1200) contains the transition to a single fever) Therefor, the iin server temande appears to be the mast, oneal one, However, this peeralty ofthe iit server assumption i tually pid in terms of complet of the aalyssalgrthms (eg for compoting performance figure) “Some comment on stochastic net stone, Defiiions LS and 1.58) consider only deterministic timing of rations. In many cases the timing ff not deteminic, being charactered by the probability distbaton futon (PDF) ofa random vst. La this cas tocastle net systems fre defied. The mont ural approach Isto consider one-phase fring {tancon-imed models. Stockasic Pesi nets ee deincd in Chapter 4 ‘The following floral comments (ht can be sipped without aflesing Ae comprehension of theres ofthe mater yt pot ou tat stochastic ‘etn ntecaa be viewed as queting networks proved with esemaricaly Snple and formal way of introducing syachfonizations among ques. "The considerstion of sochatc Pet ats ss mentioned above is mites in practie by theft that outing probit’ arent arly expresso swoon one phase Sing is assumed for traston. The advange of 0xe- [se ver tiee-hase fig ie that tokens do nc seppear as ia the ‘econd plas ofthe threehate seman this token eg. customers) ‘Sonservstion la of the oninterpeted et system are preserve, "Generalized sochtic Pe nets (GSPN) be one phse) soshasticaly timed trannisons spd immediate Wanstons. Immediate tansitions fr i ero tne (2 tantancous frag). Confets among immediate tanstions te solved, mong otter mechanisns, using routing probability schemas, [Because a single-pass fring seman sued, immediate transions are tit respect to timed tanstias [sce Almone eto (1984) for ‘te seminal detnison of GSPN, and Ajmooe ea. (1989), "om concept pot of ve the modeing ower of GSPN rater erie napmusbe EON), that ceee introduced to partially. (On net systems interpretations 0 server repeentaon (Mais 1957 (etd network (0) Deseripe goetung network (c) Generalized woshaic ‘Resta coke mot ih re nics nee Figure 1.1 (Malls, 1967) is almost setberplanatory. As & sammary,2 Invoducing Petri nes wi stochastic interprtation or a sometimes more convenient (Campos (al, 1951), agncronizd queuing networks (SQXS). 1.5 APPROACHING CONCURRENCY QUALITATIVE PROBLEMS CConcarent and distributed sytem are usually df to manege and “understand, This misunderstanding and mistakes are equene ding the design cele "Avry of cuting down the cost and duration ofthe design proces it to exci ins formed way properties the stem sbeuld enjoy and to he ful roo ecigue.Etrrs coud eventually be detected lose to ‘he moment thy ae intoduced, redoing thelr propagation o subsequent sages. “Gal ew guatatve properties wil be considered inthis introsstory chapter? The are general inthe sense that they ae meaning for an? ‘Scnturtent system, nor nl for thove modeled with Pett nes, Nevertheless, {hts satemenss wth Pet net concept and objects make them especially ‘ay to understand” in aay cases Te proper to be comidted are 1. Roudednes, characterizing tenes of the sate space. 2 Lives cated fo potential aby im all reachable masking, Denilock-frenes sa weaker condition in whch ony global infinite ivi foe ibility) ofthe net ssl model guested, even if some prs of do not wot at all 23, Reversi, characterizing recoteabty ofthe inital marking from tay seachable marking 4 Mata! excason,desling with che impossibility of simultaneous Sabmarkings (pts) or Bing concurrency -e). et ws conser the net in Fit L12(2)-The ring of allows sto reach the marking M ~ (00,1, 1)" Le py and py have one token. Ping m0 MO" (10,10) is reached. Repeating @ met tbe Sequence, he ‘arking’M* = (1,000) lr reached $0 the marking of pcan beat Tea igh Ia practce the capri ofthe pial clement rpresented by ps shouldbe its, 20 an everlow can appear. Plc p, is sas 0 be ftbounded. Attention mst be paid fo the above stuation because un [oundednes canbe a pathologie stuaton, Sytem boundedses (Le. all ‘lucrs bounded) » good behavioral property “The moi mor of tokens a pce may contain sits (marking) ‘bound. A place is bounded ft bound Gite, A net system is Bounded ‘sac pee Bounded. “Approaching concurrency qualitative problems 21 » 12s gestae patiloaltearor (2) a wounded, eeth Ginehnesseverbl et en, (6 sessing he il SSRSECe My i) bebe ot ten Hs For aay inal marking we can define onthe ne strate of Fi. 1.1(2) ‘te flowing ten cosseratin laws hold sn} Mn)» Mi = 2d MA 499 KO) oh tga ed =) + ie = MO MON ye tka Balls ve Meine aia aking and ny readable mating Thee -M{p) 5 mit (MO KMD) Be) emiat) 1223 Men) eR) |= 56 “Te above ingles mean tht for any Me at system is Dosded Fe er Song than toundedas called sectoral owndedaes Pe pod ndepenenty ote ail marking (nl nes of My sumed) Tender rom the marking in i 1.124). Aer ta, 0 an salon Soest ded ees ocd. Ane se i id we GLetoince Ge. hom sy reschable marking) if least one eects be fred A cogs consent deaiok-c- soap ace Anson ti pot rable ta given marking M ines ie svansifndringseerns oeang toa marng Ma wich ASS Sen Le fos Be). A rostion ie Ut posentaly ‘en al tachble masking In ober word, a tanson He firable in all reachable markings. In otter VOR some activity), A act2 Inroducing Pet nes For say intial marking we cn def onthe net structure in Fig. L12(a) oneness holds (infact «total deadlock can always be reached) No-Leness for atltrary inl markings refecs a pathology of he ct ‘Sroctue structural nonivenes. acts structraly ive there exits at Tent one ve sal marking "A porosical behavior of concurrent stems isthe flowing: a fist dance it may be acepted st ative tha ireasing the intial marking (Grpinccesing the numberof esures) of et ystem eis in making Ave Thetive net sytem in Fig. 1120) shows tat increasing the number ff resource san lead to dealoce situations: adding token to, can belived and daadock is reathed! "Another teresting property ls eves. A not system is reversible digit alveys posse fo etn tothe nil macag (Le. tis reachable fRom ay otber reachable marking). The net stem in Fig. 1.12) not ‘evetble Infact ia otal dongs exsts at some reachable marking the tet yen: cannot be over; the fevers is wot tv 28s poted out [EF 113() where the net sysem is nt reversible but live, thus dead locke Tiveness, bouadeness and sovetsibity ae jut thee diferent goad” ‘ehavie properties that maybe interesting to Study ina net system. Fs tre 123 shows examples of the eight cases we may have. Therefore boundedness, liveness and reverb ae independent properties, "Te nt bs property we havoc in hr erin is mtu excasion, “Tis propery capure consents ite the impossibly of «simultaneous fecem by two tebus torn singe store, Two places (Wansons) are in {puto clusion if they can aver be simaancousty marked (red). For {he net psc ing. 1a) we can write MCD) + Mp + A) =. Ths Mp.) =1 = Mp) = M(H) =O Mp) =1 = FG) = MB) ang (M(p) = 0 oe (Mp) = tov for every reachable mating ie fd py ae in mutual excision). Table 11 sammarizs the definitions of the dllereatpropenice we introduced in this secon. 16 QUALITATIVE ANALYSIS OF NET SYSTEM MODELS. “Techniques for anlying net sstims aa be dived into the flowing soups 1. analy by enumeration 2 analysis by tenstormaton 2, analysis by transio Qualative analysis of net sytem models 2 ‘eae 113, Bounds (Benes (L) an overs (re ‘jeden poperise, ‘The fet the groups are called ate method, sd thie aplication to ‘aus ytems ae stact models leds to ene resale, Siulston methods te il mami and proceed exercising the net system model undet ‘eran strates Ip this case some bugs canbe detected (eg some dead foes) allowing “some confidence on the modes problems are pat sssfered during the snltion proses, Homevec i general, ulation ‘Betbods donot allow properties toe prove, even i hey might be ot {eat help a understating the modeled system. In particu, sultion ‘hetods ae exvemel sf when tine asoited ith the et evoltion (dined systems), or when we wih to know the reponse of the sytem escibed with 2 aetia an ouvzonmient which i bo dened by snala- ‘oI hi secon we wil oly overview some ste methods pedm4 Invoducing Petri nes “Tee 14 Senasing me ase guatatve propers Trap a mrt m0) tanta cog BA cna ap seaman FE manent find tee hs en ane ni RM) > se ct mimi Aa) ES) 1 aac met en ci i eee Se eae + is wrocrarally fv if M(t) ming (V. Mo) Bre oye graph (8G) which represents Indi, the act markings and tanston| Hee tac net systems bounded, he achat graphs fate ed the dare qualtae proper can be verifled ean he net sytem is Soundol, the shove paph i inte and is theefore impossible fo ‘osuuce tats cae, ie erephs known as covery grap ct De ‘Sastrced Gee, for cape Hake! (1930), fa spite of power, en ‘Serato ot dificult to apply even ia mets wth few places, becase tf is computstional complex (@ is stony combinatonal The ontmeraton snaps tcenigue for bounded stochastic Pet net systems const ofthe geeratinn of ab uaeryng Mackay ein (SC). ‘Aipetormance Neues ne inter computed onthe MC, Asvoning expen ‘Gaull Les memories) fing tines the MC i fomarphoos fo the RG “Analy by trmsformation based on the following ica: given nt system ON A) im ich we wih to very he set of propos, we {Zaform int the et sytem (N35) such tat: QVM sie he ropes (sass thm (te {tasformation preset te properties 1) 2 Nip eae to very the proper Ta (N".MG) than in (NM Reduction methods ar a ses clas of transformation methods in which ‘Tcegueace of net ystems preserving the propetice to e studied is com Tirta. The construction one in rich way that the net tem (N" To ed oe a kinas) than the previous in the sequence, Qualitative analysis of net system models 2s The applcabilsy of reduction methods is limited by the exitence of Sneducble net systems. Practically speaking, te reductions obtained are ‘orally considerable, and can allow the desired propets tobe veried tlcoty. Becaur of the existence of recuse sem, Us method mus be complemented by some other methods. Foal, stmt analss techniques carefully consier the net suture (ence thir name) while the inital marking acs Pascal asa paamcter ‘Seuciral analysis teciques investigate the relationships betwen the behavior ofa net system an the stactre af the net In thi nt as Says tecigues, we can distinguish two subgrou: 1, Linea algebra Linear programming based techniques, wich are based ‘the et system state equation, In certain analy they perma a fast ‘agnods without the neces of enumeration ‘Graph-bsed techniques i wich the nc s sen a bparite rected trph end some ad hoc seasonings are spoled. These methods ae eecially ffecive in sealing resisted sublasses of eran nes ‘The three groups of analysis techniques ound above are by 90 means txcluive, but rather the) sre complementary. Normally the designer can ‘them acoaig tothe ends ofthe ongoing analysis proces. Obvonsly, ‘though we have dsinguished between reduction and structural ass tretods, sonst he pointed oot tat most popular rection fectiguss eballly on the net sete level tnd thos can be consered boat ‘Suctaralfemigoes For what comceas the quaative sna interpreted stems, sould be pointed our atthe properties ofthe undeying eutgnomeus model ‘Cosbeoalyauficet (eg ton bounded) aceay (og fr rexchabiliy) (nether saficiet nor necessary (eg for Ueness). For arcu net fblastes (eg simple nets) liveness properies are preserved det “Tearoble sasumptions’on the bebsvor of the envionment (ear prope not infite dely in Gring a coatnuouly enabled wanstion, {loa fame on chokes, ell outcomes of confit are being chosen repeatedly), 6A Reachat ty aon ‘A iucking ised toe reachable in system (N, Mi if there exis 2 sequence © applicable st Me sich that Go) M. Ife were able fo cou pute all sochable marking, Me RUN, MG) ad ther reechabity rela ‘onsips, all qualtauve behavioral properties should be analyable. A ‘aor problem ares in sjtemsn which te number of reachable markings ‘Sinfnte (unbounded systems). Because infnite state (marking) tems sant eatly be represeated by enumeration, finite representations ave ‘been proposed: Bus in this case itis posable that relevant information for26 gue 114 Bounded, and evel em an i each raph “This presetation being more engineering oriented, let us restr ourselves toe cate of bounded stems Reachability sanpis approach for bounded systems is based on the cahusive sequentialized simlaion ofthe possble marking evolutions The main matoo ofthe approach i ts computational complet, so- {ale tte explosion problem he numberof markings ean be exponent Sith eopect tothe se ofthe el (measured, for example bythe mmber ot pac). ‘Denton L6. The reachability graph associnted wit sytem (N, Mis 2 graph ROU, AX) which each node represents a marking reachable {om Ms and each tre repress the fring of» tanson. There exists a feeble og which go rom the node representing M0 tha epee eng Me itf'on ring tom Mme each =) M 1 the marked et is bounded, the graph consruton proces i stright {orwar Tiss when al the possible fogs om the reachable mark ings have been explored. et us comer for example, the system in Fg. 1.14, assuming p, is emoved. Tiny only ab emailed ig Ip ae pare marked 03 B huve are enabled fb ised before, the marked places ate, £04 Pu ‘thers els fod Before, sand p shoal be masked. From any of fe tas two maskigs py and py wil be unavoidably marked and d being the fn enabled trnson, the ital marking sould be recovered. There {bre our system bas ve makings (hus Bounded), From a dzet in fore our system bas five markings (thus is bounded). From a direct in Qualitative analysis of net system models 7 and p(B end) nme pf pl i ‘over smaltseousy marked) ‘Moreover, considering the ceachabte markings and the net srectare (eh pre-union), ring comeareney between tanstons band ¢ appears {in the reachabaity graph band seem tobe conicting), Observe at his point that introducing py in oar set doce mot change the reachability rah, bot tanstions 8 and Become in ring mutual exchsion. Tis ex- Erne shows hat concireny tua excision on ays cannot be studied tthe rechabty graph lone, becaue his les sequentalizd vision tbe comctrent evolutions Reversblty (Le recoverabiy of the inal marking cannot be tied considering aly the sate space. The reacbablty relations among Sates (totais) mst be taken nto account. Because ll marksngs sre rack the om the inal one, yt shoal be reversible fin the reachab ity sap there ext pth Irom any node to the oni one In ther we Property Li. A net sytem reversible iit seacabity graphs sronly ea systems reverbl, ay ranson canbe fred once and agin if that ttonstion i fale at leat ace fom the intel marking. This i re ‘pcre the ail marking bing away reachle, the teansion can be fred again More precisely, we ae saving tht in 2 feverible et system 1 teaution ve ite able na sequence staring inthe inal mare ing tthe sytem isnot reversbe but bounded, Heeuess is also char ‘cern but the condo i sghly moe complex Property 12. Let (NM be a Bounded sytem. Tension #5 ve in (MI labels atleast one ate of every tong connected component foie reschbity raph coming is wanstive closure (Le. sch thatthe ‘cot issues nodes fe lncaded i the component Kl), In generals system may be unbounded. Therefore the reachability graph ‘rasucion process would never end To avoi thi, an abandon cond ton can be taken into ascova ithe contraction proses: Property. Pace pe bounded in, Mit hee exists no M reached fom ich hat M2 Mand Mp) > Mp). Thersore, the syste (NM) ' uthounded (abendon condita) lf there exits Mf eacable toa Mf, Such hat A> Mand Mx Me EM), > Mcand MM she repetition of aon uo conclde ‘cc unboundedness The proof thatthe condition ils necessary sBsed (nt ren Sr Karp Miler (Karp and Miler, 196), "A last and obvious consideration sbout tbe construction/analysis of the2% Inroducing Peri nets Property 14, A system is deadlokable ff «masking not enabling any Fe ie tound fie. a node without secessr points out deadlock). CConcuding, analysis ecnigues based o the reachability graph (hore ‘Sap pone for bounded systems) are very simple ftom a conceptual ‘alae view. The problem tat makes his approach impact io many fics nts computational compen the state explosion problem. Fire SIMEON io very simple et stem: pars are sent from store 10 bres and 3 The subnet genrated by paces (8, C.D, imposes rome ‘UlSetacn on the way parts ave dstribted to the destination stores ‘Saal schadule the disibution). The reachability graph ix even if Bir bec strctred’ for clearer pretestabon, cific to undertnd and ‘Reape The reader can uy to check on the reachabity rap () ha the ‘RiRAEE Gettin suategy i: pst te sent i a 1 1 relation tothe ‘etonstin stores, bat along sometizesup o fur conseautive dares ‘ea gwen sore Ge fea adjusting the posse demand, bot maintaining tbe evel fas stein). in butt st inp tee at ecaiicrrty ra ar bu foro gvem nl marking the number of resourees (8 Somber of machines sizeof ore, et) changes, ne and completely ‘Eiieren) raphe shoud be computed. Othermse stated reachabiy SASH dbs aot alow paramere amass on the belavior of net Seems 162. Net aptem redactions Even if reachabilygrphsbased analysis techigues are compete for Sounded systems he computational comply Kms tee appiabity Pguacce, Net sytem seduction i+ feat analy technique tht Shs the ala of met models by producing transformations oa is Sercture and, eventual omit inal marking, “Ta spre based on te definition of it or catalog of redaction le, cach one preserving the subset of properties (Uvenes boundedness, Tet ec) tobe analyzed. Te tasiormaton procedure is erm {ive by nature: Bente property (or properis to be analyzed the subset Strle that preserve et) taped ual the edaced system becomes edncile The ivedotle sytem can be so simple that the propery {inder dy ily checked (oe ltr, Fig. 117(@) In ober cases, he reeSSan oct just "more simple’ to be aalzed, and other annyis ‘Sinucs boul be wer notber words, echgues to analyze net syste Inodel are complementary, not excisive ‘Reduction tues are atsformtion sues interesting for act exaois ‘when considered inthe sevesefenve thy become expansion rls pred in the reverse sense they Decne a eeaee en) epproach. i & ni STORE 3 sciig 10 he wtgy dea bythe ‘Bec pnd by [C.F F (thee stem: ) be RO i gue 118 Par of SIORE30 Iuroducing Peri ness tbe specication by consrstion. This is interesting when comparing with the more elacical spproach bused on the eration of destipion aad tals. The erative process has 90 bass dsdvantages 1. the lock of general eter for modiying (corecting) a model which des not meet the requirements made in the validation 2 the operational ifiaty inberent to he validation phase. Obvious, ths eta wil be snl edaced fs computer-aided design (CAD) ‘spt arabe Nevertheless, becuse there exist 20 universal reduction rules Rit Ltt fay redues aay system), ot poasble to synthesize all of them by epee refinements rom a praccal point of view the design of the transformation rules catalog eprescus a compromise between completeness (i. tats tion expats) and wsefunes. "Reduction rales have gle ptten: Stan applicability precondition i true then reduce the net system. Behavioral endlorsractral statements ca be done for the applicability "The behavioral snemens canbe more powerfl fora ven ‘i mig to de compttn way oct mee come So {he appleby preconditions presented ere are based on sacral ‘Snsdertons, the ata asking plying an ariay role aa parameter. ‘Recording othe eduction rls wal bave the following general pattems: 1 srncurel condition and inal marking contin ae tree then make sacral change and marking change. [A very asc it of rodution rules is presented. Adana detail te {Been ony forthe ule of mpi plces, which ae redundancies ia the et ‘ste model fen inpiatplce s removed, then (uso) sybebon- Enos dappeat and otberfedocton rales ean be app. () A bare Kt of reduction ries Figure 1.16 presents graphical strata and marking condos of ait fof price caver of reduction rules (Sv, 1985-1 is nt ic to ‘Shier tat they preserve sich properties as veness, de bounds of places ‘fs oundedae) and ifthe second place i» RAL bas nly one input tatsitin, revert ‘+ RAL a pater cat of the mactoplce rae (Siva, 1981, ae of the anata res (Berthelot, 1987) ' | | ‘Qualitative analysis of net system models 31 4 “HK Mes Cho € | OE gee 116A tai ratucon Ki ‘hat Ri can be iil penerlive reting several seoopsin which the place alvaysappeas. Lienes, the bound of places and revert tre preserved Meteove, if the place conti several tokems, tenes boundedness in general, not the bound of the net stem) and revers- BD ed RC parr cnes of ent nd deity + RBD and RCP ae pate cases 0 identy anton tes Berl 5) ‘Ar areing rma is the analogy Demet rls a he sme evel in ig 127 taseally rales RXZ ae buted from rules XI by changing the rol of ples and tanssone (daly) ad revening the arrows (ome: ‘hing important oly for rales RA), Deity (and reversing ate important ‘cousepts for a deer uadorstareiny and tresunatie eeastvatioc te meeQuaietive analysis of net system models 3 Let ws now comer the set system i Fig, 19. The subset defined by opty wait dep. vexfes the pocondion of rae RAL Thus it can be ced 10 & place, p (Hg. 1.17a). The same olds for opt fee a is redaeod toy (Pg 1170) The suet load fy dept unload abd nithdva~ty can be reduced according to RAZ (see ot 8 fy in Fig. L17()), Pace en Fig 1.17) spit (one of Ge ival pecralcatons mentioned for RCI, Thus i ean be removed, fod bal rainy and ge pny ea Be Feduced tO Py aD fF Sgocvely Gee Fig 1170) Places py and wei wih ae imps CI) in Fig L17(), tus the net system in Fig. 1170) obtained. Paying the {oben game, «place (eg. objec) can became emply in Fig. LIT) and Ter obec-fy san be Tewoed (RAZ) toa singe Wanation (i. 1710) ‘Therefore, orginal net aytem ive, bounded and reverse, Co & 0) Impticieplacer ‘A pice na net systema an only contain the fable sequences If place, for an inkl marking never consrae the fmble sequence, t can be Temoved witoat changing the sequential observation ofthe bear of the act sytem (the st of Grable sequences). These Bebavorally de- fed places at called (Big) ipl places Let bea et and N, the at resuling fom removing place p from Ny ‘re and Pre ate the contapondng pe incidence fron HEM mia making for Nf, = (MEAG) denotes the inal marking of N. nition 17. Civena syste (NM the plac iii (TP) for any [reachable marking ia ON, Mf), Ge. VM" ERIN, YQ) and any ouput Toston ofp (Le. Ye e(p) the following bois ra Pra) = Mig) 2 Prt.) ‘The net atin Fi. 118s unbounded (the uigue unbounded place) and on-reverstle (abo becatse of .). Place pis impli. Removing Pr tbe eytm becomes bouaded snd revere! Place pin Fig 2 poxes fring mutual excston Between b and e Since py itt plist pace, the ‘edu rule doe not preserve fring mots exclusion. According tothe ‘eintion, Sable sequences are preserved. This the folowing i ee Property 15, The elimination of impli laces 1. Preserves: deadock-ecees liveness and marking mutal excisions, 2 Deer mot preserve: boundedess, reversibility and fring muta ceclason. e > gue 17 The reson prose shows (6 (2) Sinctimes it i pracical to inposo a secoed contin tothe dentin of tpl places: marking redundancy (ae. compatable from the other ‘markings), The marking of p, in Fig, 118 cannot be computed from theEy Introducing Petri ness Lis ine 75 ig implica ot aig mpi Removing, {Be ts ocho a pp considering now: marking ipl paces. Because ofthe adios] redund- Sey, marking implicit places preserves the state space (Le. the reach hil apts of he et seem with und withot p are Somorpboos) and ‘erelne preserves two ateadymeatoned properties: boundedness 2 versity. ow ea implicit places be detect? How compler isthe proces? The property bebnvoral so computationally complex behavior-bsed alr [Mums shou be sed: The next property ges avery sample algorithm, bred onthe solution of near protaziming problem (LPP) to detect “post ofthe practial cree’, Because, LPPs ar of polyaomial ime com ‘ety (Nethouser ef al, 196), the tohnigue bat this comple. Ths pores derives from some relatively complex arguments (ee Colom ‘nd Siva, 19D) Property L6 Lt (NM be 2 net system, and defined 8 follows emis YOMte ibject to FF C=CIP) a YO Pret) tn2 Pia.) wep PD Y20vp=0 Assuming Mi) © 0,8 M{p) >= then pis impli Remark if Y°C = C(p) constant, then p& 2 marking implicit pce. ‘Tae computation of LPP for p (Fi. 119) ges «= 0 fo: 4 [Y= (001110400) o»[e(n) = Cl) * CLP) * E(B) + CP] apes Omen Qualitative analysis of net sytem models 35 ewe 119 Paces pnd pry, ant) a ngs Figure 1190) shows a reduced net system. Tt can be obtained seducing yb. into a place (sy py) (RAL) and aly pef-p-a-Pnto Me Now EAL aloms us to fse I od p, The new pace is mpl, soit can be fice to a baie el petape hone Loken. Therefore the origi net ‘prem is live aad bounded (Note: It is abo reverse, but we cannot faactee ths because of the fusion of bp. iP) 1.63 Linear algebraic tectnigues ‘The behavior of ane system model is eslynoetner, nevertheless the sovaled ate equation M= My + C.- 20, 9 20 (ee eq (18) rep ‘eset a nice Hear reiasaton, Unfortunatly the euiseace of spuious ‘Shon ection 11.2) leds usualy to Semideeon algoritns (oaly ‘secesayof nly sufient condos) to ale such bebaviorl properties ‘seach, boundednes, deadlock trenes, muta erlsion, ieness ‘or reves. For example, = (30,0,2,0) and Ma = 02,000" ‘se wo spurious solution forthe systems in Tig, 1200). The fist alloes ‘toy tat pe bounded, wide t's realy Lbounded (check), ‘sa deadlock. Then using the state equation we cannot concude that the ‘ystem in Fig. 120(a) is deadlock. Spurious stone can be removed wing deren approaches (Colom snd Siva, 1918) For example, tr ces that adng plist placer, ow sjtem model wih sential behavior is obtined. For ean Det ‘gymtegu, if the implicit planee ane chosen carefull, the state equation of55 ong Pe ne ae es gure 129 Two egal bebvir PBounded and ie net seme: dashed ac, i es ol eS 7 VALS » system in Fig, 1200) hasbeen obtined by ang implicit places po Shi'pe to that in Pip 120). The abovementioned spuriow sluons, Wis Ab Ny, are not projections oa P ofthe solutions of the sew ste hatin. Moreover, we cn cnctade now tat the new (and original) net ‘stems were tounded for p and deadlock test ‘iasicl reasoning to prove login properties wes Invariants oo he pcbavior ofa stem, The ight aad let sonaegative annals of he [Belonce mau ato wo kind ofstrsctural objets (p and eions) 1 ¥20,¥". C= 0-9 ¥8:M=Y"- My (token comervaton Inv) EY 20,6. X=0-2 3a suth that Mo} My and & =X (eydicmaring ietavin) “The token conservation lms marking avant nice by psemiflows. ‘Unally they are caledpinvarians ‘The computation of inal psemitos (¥) and minimal emiows (x) bos boon extensively staied However, an exponential number of Chm Semitows may appear, Therefore the ime complexity of this ‘eputadon cannot be polyoma In Colom ad Siva (19813) a sody fred out merging tational ecnigues in convex geomety wit those ‘Shelopd wile Fes nets. From s cmoxprel point of ie, the consis ‘Sason of slfows provide decomposed vies of de structze ofthe at Stoel In ig. 121 the decompontinn indoced by te minimal pseiows nodel 1.21 the decomposition induced by the minimal p-xen Ow Quattatve analysis of net system models 37 gee 121. A decompo view of the et em in Fig 18 Mort am) + Mlload) + Mop.) + Miwat dep) + M(depost) =1 (15) M(op) + Misi tee) + M(unlad) + Miwait with) + ‘Modhdrawal) a6 M(empo) + M(deposi) + Miobject) + M(withdraal) = 7 (7) MOR) + Miload) + Munload) + M(depost) + ‘Mtihdrawal) as Becanse markings are noo-aegative iategers (Le. Yp @ P,M(p) 2.0), the38 Iniroducing Petr nets 1. Bounds: M(p) <1 _ Ye em. oe Momo) =. Mob) <7 2. Masking mutual celsons among the flowing subset of places MO)M) = 0.4 «wat a ond, oy et de. deport Lp te, od, i thre 2 inat anid deposit, itd ‘Tue decomposed view of «tse i oven if o drive an i ae tan Forage he nt atom in 19 canbe inplemested acme onal peceses (or Mohiel se Mochine2) and tice eee teres ble cmp and R) here a mutual excson seme peor car leh tecniqys preset as 10 compte (poison ine nian ae) semidason (nce of suit conan) algo ‘SmsLsenatc to ntl shing pavomeric vay (ea chaning the sa ee comers, tue of resources, ina dstbuton of estes a onan The felling sbsetons sty making towed a imeem), dendokteesest (0 scr! Hveness and ene (Grand seventy (8). (0) Marking bownds ond boundedness [Roaring the rechailiy condition in the definition ofthe bound of «| ac feo Table by asing the ste equation (14), eh srt Bound ofp is defined as flloms 'SB(p) = sup (M(pYM = M+ C- 720, 7 20) Late, be the characteristic vector ofp «,(/)=H f= p then 1 che 0. The ‘aructural bound of p, SB(p), can be expressed a8 s linear programming prolens sn)= ms ; subject toM = My+ C720 «LPP2) mee “tere $B(p) an be computed in polyoma ne Ta spane mat Paes ne Ts say soa), nd impementains of te ca "ett meted edt gaat ins ie comltin Sin oeen deine tang» inca rebraton of the sensual ines ton Bp) = Up), Taos me ae em I Cound of oe Ge M(p) sy we bare Seen conten pomad ne If SB(p) < then B(p) $k (Le pis bounded) a ie and 1 Qualitative analysis of net system models 39 ‘eories (st, for example, Murty (1963); Nemaser ea: (1989; other. vin ll the needed arguments are compiled snd adpted sn (Sra and ‘Colom, 198). The inportan: poi in ts overie is fo convey the ea ‘hat other theres re hep to undestnd in» deep and gence ame ‘work many sparse rere oa net systems’ behaviors "The dual near programming problem of LPP? ithe following (ee say ‘ext on linear programming to check i) Sp) = min 73 bject 0 7 C0 LPP? has alwape feasible soliton (M = My = 0) Using dunt and ‘boundednes theorems from linear programming theory, both LPP? and {EPPS are bounded thos pis stotorly bounded) and SB(p) = SH(p) it thete exists fable solation for LPP: Bee, suchitat YF-C0 ay ‘The reader can easly check thet LPP2 makes in polynomial ime a im lsc ware’ forthe structural bound ofp on 2 set of stata com- teats lncloing all the pels (¥ 20,7» C = 0. rom the above dscsron and wring the alleratives theorem (ssen- say he Minow Faraone) he owing OD Property 17. The following tree statements ae eqitalet 1. pis suucturlly (Le, for any M,) bounded 2 By'2e, ach that ¥7" C0 (plac bed characterization Ave dew tat CQ er CoN Cy) k=O i aticed {anstion.bsod caracteiatio) Property 18, The following three statements are equivalent 1 Nis seucturly (Le, ¥A4) bounded: 2. gy 21 such that YF C's 0 (plece-based character; Wor 0 ch that C. 20,0 X= 0 satinied ie X 2 0 sch that C-X 2G end CX 40) franition based chracteteation) cures) (©) Deaslockfroenss (ad liveness) ‘Token conservation ns ae invariant properties ofthe behavior of net Spsems that may be very uefl to prove deadlockreeness Using the ‘avant in age (15-18), we shall prove that our ae sytem Sa Fig. 19 deadline Ie there exit a deadlock, no transition canbe fed. Let ust t0con- ‘stmuct a marking in which no vansition is frsble. When a unique input40 Inoducing Pet ness (op) « Mideposl = Mop.) = M(unload) = M(vihirowal)=0, and he {oben ontevation ln eqs (15-18) rede to: art ram) + M(t dep) = 1 ase) Mat fee) + Mat wits) = (sa) “Mlemp) + Miobec) = 7 a7) Mie) =I (180) ‘Becans R sould aivays be marked tthe present stage, to prevent the [Bang of aud f poco “wait ave apd ‘walt fe" shold be wnmeried ‘Toe lokea consevation awe are regaed once more, leading to: ‘wat dep) = 1 58) Ment wih) = 118) tompa) + Mlobec) = 7 12) MR) =F a) Since M(vat dep) = Mat with) = 1 to avoid the fring f 1, 20, ‘Mlempo) = M(objes) = 0s needed This contradicts eq (Ls 0 he tet pst deadlockte. “A more compact grim preseatation ofthe above deslock reness roots A M{Gond) + Mop) + Mdeposi + Mlop) + Muntoad) + ‘Mowthdranal) = hemo of fn a ty fable ‘ee wat ra) + Mai fee) 21 then one of orf flabie fee one of tis file Even ifthe above i an ad oe pron canbe fly automated (Le sto {utc pong). To prove deadlock reeness Dy means of inea lgebra We must Sates the condos ‘amigo 15 not rable at marking M” 8g pear constants This an always be doe. Neverthe it tums out to Be ‘ly elcent in vet systems where foreach place the srutural oud ‘Bip, computed through L2P2 or LPP is eqaal to the weight of ‘utp ara Bp) = Wop, 0) YP P, vee p™-The condition near form Ynys Soren tn woe the ean ota apt pa oe ha ‘hn eo pny tn Let Mo Be ant tn sch Sp = WY aE owt mips becca ak i 2 FA sient conan fx (NM) 1b dese Qualtaive analysis of net system models 4 For the tem in Fig. L4(@) the sytem of inequalies M™- Pre <1” Pre leks as follows (¥M(p) 20 Yp #0 = then 1 ee SR@)= mx Po sujet to M=My+C- 920 (LPPS) 320 “The dua of LPPA is : SRQ)=min YF My fbject to YF C's = oP aires) Yeo chancterizing when SR() goes to infty. The My and 8 20 as a feanible solution. Using first i i z zs2 Introducing Petri nes 12 ‘yo some nd conten, uly ane net (ime 329 232228 tina Property L10, The flowing thee statements are equivalent 1. tis stracturlyepeve (Ge there exists age encugh’ Mabe that (can be fied fate often: 2 BY 20 sah mat Y? C's ef (place perpostie 5 Bre e-such tat C- X20 (uanstion perspective} Property 11, The folowing tree statements are equivalent 1. Nisstructrallyrepestive (Ll wanstion ar structural repetitive 2 5vS0suh dary? CsOand C0, 5 Beet auch dat C. X20. Combining Properties 18 and 131 and omsidering that strstr pt {ene vu netesay conto for ttre iveness, the following ‘Ea reut canbe obtained (Memmi and Reveal, 198, Brass, 1985; Siva, 1985; {fs strccraly ve abd structurally bounded then BE 21 such that CX = 0 (Ge. N is conser) (le Nis conserva) [Net stratus in Fig, 122 are consitent and conservative, but there ‘ier no Ive marking for them. A ore erful analy esing the above {out teatvely allows to inprove wih rank condion onthe result iteratively allows us to improve it with 3 Fak com nee in the. Qualitative anayss of net system models 3 “Leto say that anda inequality confit relation if Pret) = Pres) 20, bv, hs an epvelees ean, lengli prin of raat Sons ito equivalence clases. Let D, bean equivalence clas. We define the following quantities, = DJ-1 er Propety L12. Let Che the incidence matic of N. 1, EVs stracoaly Hive then 2X72 1 suc that C- 720 2.31 surstrally ive and structurally bounded then 3X 21 such that C. X= 0 Ge. net consstene) ‘3V =| such that Y" "C= (Ge no eomservaivenes) yonk(C) sl 5-1 3.18. is conectad, content and coneraie then iis S00 conecied * The added rank condition allows us to state tha he net a Fig 12(0) is seacturaly nove. Nevertheless, noting can be said about stctral lvenesr ofthe net in Fig 1220) ‘Property 112 parelystrcteral the nti marking not consi sot at al Nevertheless lar that» smal enoaph nil making esa taake none a net stem even ithe net strctre is well formed. A Tomer bound forthe intl marking to make ive a et syst i based on ‘plavtiansi'¢= Tis rable wt east once, for any pnvaiaat ¥,Y"» Me EVM Pel). Therefor: Propety LAK 1 (NA) 6H sytem, then Wire Ouch that YF CeO, YF Meas YF» Pre) 21 Unortnstely no charactesizatinoftvenes exis iea algebra terms. ‘Tenet inFip 1124s strostrally ve, Adding ken op lp sess remain marked, but is aoa (4) Reverb (and Ivers) Let ws now we a Lapuney stably technique to prove thatthe net synem in Fig 19 is reversible, It serves to lutte the ws of neariants hd some inductive reaonings "Ase peclitnary consideration that makes the et of the proof easier, the flowing simple property wl be ued let (Nf) be a reverie 8° fem and M, reachable from M, (ue. So such that Mo) Ma). Thea (, M) is reversibhe