Showing papers by "A. El Moudni published in 2006"
TL;DR: A routing policy is defined which enables to solve and arbitrate the associated conflicts with a Petri net and it is shown how the conflict solving semantic prevents the deadlock in a graphical model while introducing routing functions into modelling.
12 citations
12 Mar 2006
TL;DR: A new model of urban traffic networks by using Petri Nets based on dioid algebra, the behavior of the system is described by (Max, +)-linear equations to approach the traffic control problems which rise issues of cycle times and of synchronization.
Abstract: In this paper, we introduce a new model of urban traffic networks by using Petri Nets. Based on dioid algebra, the behavior of the system is described by (Max, +)-linear equations. This will allow to approach the traffic control problems which rise issues of cycle times and of synchronization. As a result, we show how we can solve shared resource problems inherent in dioid modelling. Besides, the proposed model provides us with interesting performance evaluations, such as real-time counts of vehicles and bounds of sojourn time in each part of the studied crossroad.
7 citations