By Topic

Optimal supervision of discrete event systems in a temporal logic framework

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

2 Author(s)
Dan Ionescu ; Department of Electrical Engineering, University of Ottawa, Ottawa, Ontario, Canada K1N 6N5 ; Jing-Yue Lin

Temporal logic models (TLM's) have been recently defined and used [11] for the synthesis of discrete event systems (DES) supervisors. A synthesis procedure was developed by exploring the system state space and by determining the reachable states from a given state. The supervisor selects acceptable paths in the reachability graph of the unsupervised system. In this paper another synthesis problem will be addressed: the optimization of a DES supervisor. A sequence of events which drive the system from a given initial state to a given final state is generated by minimizing a cost function index. Introducing definitions regarding measurement spaces and measurement functions it is shown that sufficient conditions are met for the design of the active supervisor. The optimization is then solved by applying the A∗ algorithm on the reachability graph with the specification restrictions. A heuristic function is considered to help the search. An example of read-write processes illustrates our results and the novelty of this approach.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:25 ,  Issue: 12 )