Efficient nonconflict check by using automaton abstractions | IEEE Conference Publication | IEEE Xplore

Efficient nonconflict check by using automaton abstractions


Abstract:

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 impos...Show More

Abstract:

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 on relatively small automata, even though the original system can be fairly large.
Date of Conference: 23-26 August 2009
Date Added to IEEE Xplore: 02 April 2015
Print ISBN:978-3-9524173-9-3
Conference Location: Budapest, Hungary

Contact IEEE to Subscribe

References

References is not available for this document.