Name
Abstract | ||
|---|---|---|
In supervisory control theory, a supervisor restricts the plant in order to fulfill given specifications. A problem for larger industrial applications is that the resulting supervisor is not easily implemented and comprehensible for the users. To tackle this problem, an efficient method has recently been introduced to characterize a supervisor by tractable logic conditions, referred to as guards. This approach has been developed for a specific type of automata with variables called extended finite automata (EFAs). An extension of this approach to a more general class of models is presented in this paper. It means that classical supervisory control problems for automata and Petri nets are easily and efficiently solved, but also generalized based on the suggested approach. The synthesis procedure is naturally modeled and efficiently computed based on binary decision diagrams. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ETFA.2012.6489680 | ETFA |
Keywords | Field | DocType |
Petri nets,SCADA systems,binary decision diagrams,finite automata,industrial plants,perturbation theory,EFA,Petri nets,binary decision diagrams,extended finite automata,state-vector transition model,supervisory control problems,supervisory control theory,tractable logic conditions | Supervisor,Quantum finite automata,State vector,Petri net,Supervisory control,Computer science,Supervisory control theory,Binary decision diagram,Control engineering,Finite-state machine | Conference |
ISSN | Citations | PageRank |
1946-0740 | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bengt Lennartson | 1 | 934 | 118.87 |
| Sajed Miremadi | 2 | 77 | 9.13 |
| Zhennan Fei | 3 | 26 | 5.74 |
| Mona Noori Hosseini | 4 | 28 | 4.85 |
| Martin Fabian | 5 | 204 | 27.91 |
| Knut Åkesson | 6 | 302 | 33.72 |