By Topic

Performance analysis of 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
$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)
B. Gaujal ; Inst. Nat. de Recherche en Inf. et Autom., Valbonne, France ; M. A. Jafari ; M. B. Gursoy

We study a system composed of two processes sharing a resource. The system can be modeled as a general Petri net and thus its performance analysis cannot be achieved using a minimax algebra. However, if the allocation sequence is known, we can transform the system into a decision free net. We show that in many cases this allocation sequence is the most regular integer sequence satisfying the frequency of allocation

Published in:

Systems, Man and Cybernetics, 1993. 'Systems Engineering in the Service of Humans', Conference Proceedings., International Conference on

Date of Conference:

17-20 Oct 1993