H. Marchand, S. Pinchinat. Supervisory Control Problem using Symbolic Bisimulation Techniques. In 2000 American Control Conference, Pages 4067-4071, Chicago, Illinois, USA, June 2000.
Download paper:
Adobe portable document (pdf)
Copyright notice:
This 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.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic
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
Hervé Marchand http://www.irisa.fr/prive/hmarchan
@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}
}
Get EndNote Reference (.ref)
|
| VerTeCs
| Team
| Publications
| New Results
| Softwares
|
Irisa - Inria - Copyright 2005 © Projet VerTeCs |