Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |

Download [help]

Download paper Adobe portable document format (pdf)

Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

In this paper, we present methods for solving the basic Supervisory Control Problem (SCP) using algorithms based on bisimulation techniques. Barrett and Lafortune first presented the relations between bisimulation and controllability and provided algorithms for solving the SCP. We efficiently solve the same problem using Intensional Labeled Transition System (ILTS), an implicit representation of automaton, relying on algebraic methods.

Contact

Hervé Marchand
hmarchan@irisa.fr

BibTex Reference

@InProceedings{marchand00a,
   Author = {Marchand, H. and Pinchinat, S.},
   Title = {Supervisory Control Problem using Symbolic Bisimulation Techniques},
   BookTitle = {2000 American Control Conference},
   Pages = {4067--4071},
   Address = {Chicago, Illinois, USA},
   Month = {June},
   Year = {2000}
}

EndNote Reference [help]

Get EndNote Reference (.ref)