DocumentCode
2536474
Title
Supervisory control problem using symbolic bisimulation techniques
Author
Marchand, Hervé ; Pinchinat, Sophie
Author_Institution
IRISA, Rennes, France
Volume
6
fYear
2000
fDate
2000
Firstpage
4067
Abstract
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
Keywords
automata theory; bisimulation equivalence; controllability; discrete event systems; automata theory; controllability; discrete event systems; intentional labeled transition system; supervisory control; symbolic bisimulation; Automata; Automatic control; Closed loop systems; Controllability; Discrete event systems; Galois fields; Polynomials; Size control; State-space methods; Supervisory control;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 2000. Proceedings of the 2000
Conference_Location
Chicago, IL
ISSN
0743-1619
Print_ISBN
0-7803-5519-9
Type
conf
DOI
10.1109/ACC.2000.876986
Filename
876986
Link To Document