PETRI NET WITH CONFLICTS AND (MAX, PLUS) ALGEBRA FOR TRANSPORTATION SYSTEMS

In this paper, solving of conflicts of a Petri net model with techniques of (max, plus) algebra is considered. We define a routing policy which enables to solve and arbitrate the associated conflicts with a Petri net. We show how the conflict solving semantic prevents the deadlock in a graphical model while introducing routing functions into modelling. To illustrate the proposed results, a public transportation network is worked out. The aim is to analyze and evaluate the performance of a bus network which is represented by a Petri net with conflicts and a state model in (max, plus) algebra.