By Topic

Supervisory control problem using symbolic bisimulation techniques

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

2 Author(s)
Marchand, H. ; IRISA, Rennes, France ; Pinchinat, S.

In this paper, we present methods for solving the basic supervisory control problem (SCP) using algorithms based on bisimulation techniques. Barrett et al. (1998) first presented the relations between bisimulation and controllability and provided algorithms for solving the SCP. We efficiently solve the same problem using the intentional labeled transition system, an implicit representation of automaton, relying on algebraic methods

Published in:

American Control Conference, 2000. Proceedings of the 2000  (Volume:6 )

Date of Conference:

2000