Title :
Efficient reachability analysis of bounded Petri nets using constraint programming
Author :
Bourdeaud´huy, T. ; Yim, Pascal ; Hanafi, Saïd
Author_Institution :
LAGIS, Ecole Centrale de Lille, Villeneuve d´´Ascq, France
Abstract :
In this paper, we consider the Petri net (PNs) reachability problem, which consists of finding transition firing sequences leading to a given target marking. We focus on bounded Petri nets for which we develop a correct and complete algorithm using the logical abstraction technique proposed by Benasser and Yim. We define for that the PN sequential depth parameter, which corresponds to the maximal number of transitions to fire in order to reach any marking of the reachability graph.
Keywords :
Petri nets; constraint handling; reachability analysis; sequences; bounded Petri nets; constraint programming; logical abstraction technique; reachability analysis; reachability graph; transition firing sequences; Concurrent computing; Decision making; Fires; Graphical models; Mathematical programming; Operations research; Petri nets; Reachability analysis; Scheduling; Terminology;
Conference_Titel :
Systems, Man and Cybernetics, 2004 IEEE International Conference on
Print_ISBN :
0-7803-8566-7
DOI :
10.1109/ICSMC.2004.1399939
