By Topic

Towards a new exhaustive simulation technique for P-time 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

1 Author(s)
Bonhomme, P. ; Lab. d''Inf., Univ. Francois Rabelais of Tours, Tours, France

Petri nets are a powerful formalism for the specification and verification of concurrent systems, such as sequential systems and manufacturing systems where many processes can compete for limited and constrained resources. To deal with systems whose time issues become essential, different extensions of Petri nets with time have been proposed in the literature, each one being dependent on the application considered. In this paper, a new analysis technique for P-time Petri nets is proposed. It consists of simple operations on time intervals to determine a superset of behaviors of the modelled system. Then, once a desired behavior is extracted, thanks to a linear programming problem, its feasibility is verified via the existence of a solution.

Published in:

Emerging Technologies and Factory Automation (ETFA), 2010 IEEE Conference on

Date of Conference:

13-16 Sept. 2010