Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |
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.
In this paper, we are interested in the control of a particular class of Concurrent Discrete Event Systems defined by a collection of components that interact with each other. We here consider the state avoidance control problem. We provide algorithms that, based on a particular decomposition of the set of forbidden states, locally solve the control problem (i.e. on each component without computing the whole system) and produce a global supervisor, that can be efficiently evaluated on the fly.
Benoit Gaudin
Benoit.Gaudin@irisa.fr
Hervé Marchand
hmarchan@irisa.fr
@InProceedings{gaudin05a,
Author = {Gaudin, B. and Marchand, H.},
Title = {Efficient Computation of supervisors for loosely synchronous Discrete Event Systems: A State-Based Approach},
BookTitle = {6th IFAC World Congress},
Address = {Prague, Czech Republic},
Month = {July},
Year = {2005}
}
Get EndNote Reference (.ref)