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

Synthesis of maximally permissive and robust supervisors for prefix-closed language specifications

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)
Takai, S. ; Dept. of Opto-Mechatronics, Wakayama Univ., Japan

J.E.R. Cury and B.H. Krogh (1999) have formulated a robust supervisory control problem to synthesize a supervisor for the nominal plant which maximizes robustness. They have solved the problem by unnecessarily restricting the upper bound of the legal behavior. We show that the problem can be solved without restricting the upper bound of the legal behavior when the specification is described by prefix-closed languages. We synthesize a maximally permissive supervisor for the nominal plant which maximizes not only robustness, but also permissiveness for the maximal set of admissible plant variations

Published in:

Automatic Control, IEEE Transactions on  (Volume:47 ,  Issue: 1 )

Date of Publication:

Jan 2002

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.