DocumentCode
291960
Title
On asymptotically efficient solutions for a class of supervisory control problems
Author
Sreenivas, Ramavarapu S.
Author_Institution
Dept. of Gen. Eng., Illinois Univ., Urbana, IL, USA
Volume
1
fYear
1994
fDate
2-5 Oct 1994
Firstpage
1006
Abstract
We show that the existence of a solution procedure for certain infinite-state systems implies that it is computationally beneficial to model certain large, finite-state systems as infinite-state systems and use the procedures developed to handle infinite-state systems in place of those developed to handle finite-state systems. We illustrate this approach using examples of forbidden-state and forbidden-string problems
Keywords
Petri nets; automata theory; computational complexity; controllability; discrete event systems; formal languages; Petri net; asymptotically efficient solutions; controllability; discrete event dynamic systems; finite-state systems; forbidden-state; forbidden-string; formal language; infinite-state systems; supervisor automaton; supervisory control; Automata; Automatic control; Computational modeling; Control system synthesis; Electronic mail; Supervisory control;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 1994. Humans, Information and Technology., 1994 IEEE International Conference on
Conference_Location
San Antonio, TX
Print_ISBN
0-7803-2129-4
Type
conf
DOI
10.1109/ICSMC.1994.399968
Filename
399968
Link To Document