Automaton

Büchi automaton

Timed automaton

Deterministic automaton

Programming language

Computer science

Theoretical computer science

In Ramadge-Wonham supervisory control theory we often need to check nonconflict of plants and corresponding synthesized supervisors. For a large system such a check imposes a great computational challenge because of the complexity incurred by composition of plants and supervisors. In this paper we present a novel procedure based on automaton abstractions, which removes internal transitions of relevant automata at each step, allowing the nonconflict check to be performed over relatively small automata, even though the original system can be fairly large.

Nonconflict check by using sequential automaton abstractions