Cart (Loading....) | Create Account
Close category search window
 

Enforcing Periodic Transition Deadlines in Time Petri Nets With Net Unfoldings

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

5 Author(s)
Haisheng Wang ; Dept. of Comput. Sci., Univ. of Illinois at Chicago, Chicago, IL, USA ; Grigore, L. ; Buy, U. ; Lehene, M.
more authors

We define a method for the automatic generation of supervisory controllers that force a plant to perform a given operation by a given deadline. The operation must be executed by a prespecified delay λ with respect to the previous execution of the operation. Although our supervisor generation occurs offline with respect to plant execution, the resulting controllers automatically take into account variable task durations in an effort to increase the flexibility of operation schedules in the controlled plant. We model both the controlled plant and control supervisors as time Petri nets. In this setting, our control supervisors must force a target transition td to fire within λ time units since the previous firing of td. Our supervisor generation is based on the concept of a transition latency. The latency of a Petri net transition t is the time interval during which t must be disabled in order for target transition td to fire by its deadline. If a transition t that may delay the firing of td has latency l(t), then t must be disabled at least l(t) time units before the expiration of the deadline on td. In this paper, we discuss in detail two algorithms for generating transition latencies, and we show an application to a maintenance system.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:41 ,  Issue: 3 )

Date of Publication:

May 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.