By Topic

Efficient reachability analysis of bounded Petri nets using constraint programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
T. Bourdeaud'huy ; LAGIS, Ecole Centrale de Lille, Villeneuve d'Ascq, France ; P. Yim ; S. Hanafi

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.

Published in:

Systems, Man and Cybernetics, 2004 IEEE International Conference on  (Volume:2 )

Date of Conference:

10-13 Oct. 2004