Controllability, reachability, stabilizability and state reductionin automata

摘要

The authors present a state-equation-like approach to automata,which is used to model discrete event systems (DES). They definecontrollability, reachability and stabilizability in the usual mannerand provide theorems to test these properties. Divisibility for matricesin Boolean algebra is defined. A theorem which determines if a giventransformation to a reduce automaton is valid or not is proposed. It isclaimed that the analogies in the concepts and setting help in thetransfer of approaches in control theory to the area of DES control andalso aid in hybrid system formulations