Petri net with conflicts and (max, plus) algebra for transportation systems

Ahmed Nait Sidi Moh (1) , Marie-Ange Manier (1) , Abdellah El-Moudni (1) , Maxime Wack (1)

1 SET - Laboratoire Systèmes et Transports

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. Copyright © 2006 IFAC

Mots clés: Routing functions; Transportation system; Modelling; Performance evaluation; Petri Nets; (max; plus) algebra; Routing functions.

Domaines: Automatique

Ahmed Nait Sidi Moh, Marie-Ange Manier, Abdellah El-Moudni, Maxime Wack. Petri net with conflicts and (max, plus) algebra for transportation systems. 11th IFAC Symposium on Control in Transportation Systems, 2006, Aug 2006, Delft,, Netherlands. 6 p. ⟨hal-00470047⟩