By Topic

Characterization of timed well-formed Petri nets behavior by means of occurrence equations

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

1 Author(s)
Chiola, G. ; Dipartimento di Inf. e Sci. dell''Inf., Genoa Univ., Italy

So called “recursive equations” have been introduced by Baccelli et al. (1992) as a convenient way of characterizing the behavior of stochastic Petri net models in terms of transition firing instances and of creation and destruction times for tokens in places. Such equations have been used to prove model properties as well as to speed up simulation by parallel processing techniques in the case of marked graph structures with FIFO token flow. We extend the technique to the case of high-level net models in which conflicts among transitions and firing disciplines different from FIFO are allowed. We propose the new name of “occurrence equations” to characterize the technique more precisely. Different execution policies that have been considered in the literature are discussed, showing the consequences they induce on the net occurrence equations

Published in:

Petri Nets and Performance Models, 1995., Proceedings of the Sixth International Workshop on

Date of Conference:

3-6 Oct 1995