By Topic

Towards a simplified building of time Petri Nets reachability graph

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

3 Author(s)
Boucheneb, H. ; IIE-CNAM, Evry, France ; Alger, U. ; Berthelot, G.

An enumerative approach for time Petri nets (or Melin's model) analysis is presented. In this model, if a transition t is enabled at time τ, it can be fired at any time in the interval [τ+tmax(t)]. It is shown that the firing condition at the nth firing can be expressed by the means of the marking, the enabling point of enabled transitions, and the minimal and maximal elapsed time between to firings. This result leads to an attractive definition of state classes and allows a simple computation of reachable state classes. The approach presented has two main advantages. First, the computation of reachable state classes is more simple and does not require any solution of a system. Second, the graph obtained is a subgraph of that given by M. Menasche (1982)

Published in:

Petri Nets and Performance Models, 1993. Proceedings., 5th International Workshop on

Date of Conference:

19-22 Oct 1993