Title
Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
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 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.
Year
DOI
Venue
2010
10.1016/j.automatica.2010.02.025
Automatica
Keywords
Field
DocType
Discrete-event systems,Nondeterministic finite-state automata,Automaton abstraction,Nonconflict check
Abstraction,Automaton,Supervisory control theory,Theoretical computer science,Equivalence (measure theory),Mathematics
Journal
Volume
Issue
ISSN
46
6
Automatica
Citations 
PageRank 
References 
13
1.00
9
Authors
4
Name
Order
Citations
PageRank
Rong Su131845.41
Jan H. van Schuppen235845.36
Jacobus E. Rooda316513.07
A. T. Hofkamp4151.72