By Topic

Time, Petri nets, and robotics

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

1 Author(s)
P. Freedman ; Lab. d'Autom. et d'Anal. des Syst., CNRS, Toulouse, France

Based on the Petri net (PN) theory a particular class of condition/event nets called Ω, suitable for modeling repetitive workcell tasks, is defined. Nets ∈Ω are either deterministic or exhibit a restricted kind of conflict called choice among alternatives. It is shown how the repetitive behavior of such a net may be studied by decomposing this conflict into deterministic components associated with mutually exclusive alternatives. A unified description of the important temporal extensions of PN theory is presented, with emphasis on formal analysis. The PN notion of coverability is extended in the temporal sense and it is demonstrated that, for nets ∈Ω, the period of repetition (cycle time) can be directly computed from the durations associated with the individual operations, once the decomposition into components is performed. When the durations are specified in the form of minimum and maximum values, this period of repetition may be described by optimistic and pessimistic bounds. A typical assembly example adapted from work with a multirobot workcell testbed is also presented to illustrate two forms of temporal analysis

Published in:

IEEE Transactions on Robotics and Automation  (Volume:7 ,  Issue: 4 )