20 Chapter 3 General Light Controlled Intersection Modela cont<strong>in</strong>uous Petri net is suitable for macroscopic description, [Tolb 01]. Thecomb<strong>in</strong>ation <strong>of</strong> both concepts gives us model that consists <strong>of</strong> a cont<strong>in</strong>uouspart <strong>in</strong> the street <strong>and</strong> a discrete part <strong>in</strong> the <strong>in</strong>tersection. Hybrid Petri nets(HPN), [Davi 01], are used to describe these complex models, [Febb 04]. Thema<strong>in</strong> disadvantage <strong>of</strong> this concept based on HPN is a discrete part <strong>of</strong> thePetri net used for traffic flow, [Tolb 03] or a discrete part <strong>of</strong> the PN used for<strong>in</strong>tersection control, [Febb 01], [Julv 05] which subsequently discretizes trafficflow. In these cases, the cont<strong>in</strong>uous flow is cut to the different flow levels bythe <strong>in</strong>tersection part, which is further processed by a cont<strong>in</strong>uous part <strong>of</strong> theHPN. Due to discrete part, process<strong>in</strong>g such models is not efficient.The aim <strong>of</strong> this chapter is to develop a new light controlled <strong>in</strong>tersectionmodel based on the Constant speed Cont<strong>in</strong>uous Petri Net (CCPN), [Davi 98].This model divides the cont<strong>in</strong>uous traffic flow <strong>in</strong> consequence <strong>of</strong> the <strong>in</strong>tersectionstructure <strong>and</strong> control without cutt<strong>in</strong>g the flow to different flow levels.Moreover, free space modell<strong>in</strong>g together with the opposite direction <strong>of</strong> vehicleflow is considered. For this goal, we show a new method for conflictresolution <strong>in</strong> the CCPN based on maximal speed proportion. As a result,we show that the simulation based on our model is faster than based on theconventional approach.3.2 Cont<strong>in</strong>uous Petri NetA constant speed cont<strong>in</strong>uous Petri net is def<strong>in</strong>ed as a sextuple R =〈P, T , V, P re, P ost, M 0 〉, where the def<strong>in</strong>ition <strong>of</strong> P, T , P re, P ost are similarto those <strong>of</strong> the discrete Petri nets, as well as ◦ T i , Ti ◦,◦ P i , Pi◦ notationfor predecessor <strong>and</strong> successor places <strong>and</strong> transitions, both described, for example,by [Davi 04]. M 0 is the <strong>in</strong>itial mark<strong>in</strong>g. V : T → R 0+ ∪ {∞} is avector <strong>of</strong> maximal fir<strong>in</strong>g speeds. V j denotes the maximal speed <strong>of</strong> transitionT j . Further more v j (t) denotes the speed <strong>of</strong> transition T j at time t. The value<strong>of</strong> v j (t) is bounded by the <strong>in</strong>terval 〈0, V j 〉. Transition T j is strongly enabledat time t if all places P i <strong>of</strong> ◦ T j are marked. Place P i is supplied at timet if there is at least one transition T j <strong>in</strong> ◦ P i , which is enabled (strongly orweakly). Transition T j is weakly enabled at time t if there is place P i ∈ ◦ T j ,which is not marked <strong>and</strong> is supplied, <strong>and</strong> the rema<strong>in</strong><strong>in</strong>g places <strong>of</strong> ◦ T j are eithermarked or supplied. For more <strong>in</strong>formation, see [Hanz 03]. The follow<strong>in</strong>gextensions <strong>of</strong> the CCPN will be used: the mark<strong>in</strong>g <strong>of</strong> cont<strong>in</strong>uous place can
3.2 Cont<strong>in</strong>uous Petri Net 21take the value <strong>of</strong> 0+ <strong>and</strong> Inhibitor arcs there can be. Both <strong>of</strong> these conceptsare described by [Davi 04].3.2.1 Conflict ResolutionIn a cont<strong>in</strong>uous Petri net, there is an actual conflict among k transitions <strong>in</strong>a set {T 1 , T 2 , . . . , T k }, if the speed <strong>of</strong> at least one <strong>of</strong> them has to be less thanthe maximal speed due to the speeds <strong>of</strong> the other transitions <strong>in</strong> this set.When there is an actual conflict between two or more transitions, thenthe priority rule can be used. Another alternative is to use a conflict resolutionmethod based on the maximal speed proportion. The maximal speedproportion means that the flow which runs through the place is divided <strong>in</strong>tothe subsequent transitions <strong>in</strong> proportion to their maximal speeds, if it is feasible<strong>in</strong> regard to other constra<strong>in</strong>ts. The method is based on a flow shar<strong>in</strong>grule, observ<strong>in</strong>g the maximum fir<strong>in</strong>g speed described by [Hanz 03] <strong>and</strong> can beused only <strong>in</strong> simple Petri nets. A simple Petri net is a net <strong>in</strong> which eachtransition can only be concerned with one conflict at most.In order to illustrate the conflict resolution method we have shown anexample <strong>in</strong> Fig. 3.1. There are three places P 1 , P 2 <strong>and</strong> P 3 with zero mark<strong>in</strong>g.These places are supplied by the transitions T 1 , T 2 <strong>and</strong> T 3 with a speedv 1 = 35, v 2 = 40 <strong>and</strong> v 3 = 18, respectively. Place P 2 is supplied with asmaller speed than the sum <strong>of</strong> the maximal speed <strong>of</strong> the transitions P2◦ i.e.v 2 < V 4 + V 5 . Therefore, there is an actual conflict between transitions T 4<strong>and</strong> T 5 .A geometrical <strong>in</strong>terpretation <strong>of</strong> the conflict resolution is given <strong>in</strong> Fig. 3.2.Fig. 3.1: Cont<strong>in</strong>uous Petri net example with actual conflict