By Topic

Firing and enabling sequences estimation for timed Petri nets

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
$31 $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

2 Author(s)
Lefebvre, D. ; Tech. Univ. of Belfort & Montbeliard, France ; El Moudni, A.

Petri nets (PNs) are useful tools for the modeling and analysis of discrete event systems. This work deals with the estimation of firing and enabling sequences for timed transition PNs with unknown time delays. The marking and reserved marking of the places are measured online. The estimation problem has exact and approximated solutions that are described. Sufficient conditions are given on the measurement accuracy of the marking and reserved marking vectors, so that the estimation of firing and enabling sequences is an exact one. If the estimation provides several solutions, the PN is extended in order to give a unique solution. Numerical aspects of the estimation are also investigated. As a consequence of this, the proposed method provides interesting tools for the modeling, performance analysis, and above all the monitoring of manufacturing systems and road traffic networks

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:31 ,  Issue: 3 )