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 the 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 on relatively small automata, even though the original product system can be fairly large.
Additional Metadata
Keywords discrete-event systems, nondeterministic finite-state automata, automaton abstraction, nonconflict check
THEME Life Sciences (theme 5), Energy (theme 4)
Publisher Elsevier
Persistent URL dx.doi.org/10.1016/j.automatica.2010.02.025
Journal Automatica
Citation
Su, R, van Schuppen, J.H, Rooda, J.E, van Haalen, R, & Hofkamp, A. (2010). Nonconflict check by using sequential automaton abstractions. Automatica, 46(6), 968–978. doi:10.1016/j.automatica.2010.02.025