Time Optimal Synthesis Based Upon Sequential Abstraction and Its Application to Cluster Tools
| Autor: | Simon Ware, Rong Su |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
0209 industrial biotechnology
Theoretical computer science Computer science 020208 electrical & electronic engineering Control engineering 02 engineering and technology Projection (relational algebra) 020901 industrial engineering & automation Supervisory control Control and Systems Engineering 0202 electrical engineering electronic engineering information engineering Cluster (physics) Pruning (decision trees) State (computer science) Electrical and Electronic Engineering Logic Control Abstraction (linguistics) TRACE (psycholinguistics) |
| Zdroj: | IEEE Transactions on Automation Science and Engineering. 14:772-784 |
| ISSN: | 1558-3783 1545-5955 |
| DOI: | 10.1109/tase.2016.2613911 |
| Popis: | The Ramadge–Wonham supervisory control paradigm has been shown effective in dealing with logic control. Nevertheless, time-related performance is always one of the major concerns in industry. Current methods for synthesizing time optimal supervisors are incapable of dealing with large discrete-event systems (DESs) with massive state spaces. This paper proposes an approach for finding a time optimal accepting trace for large DESs based upon sequential language projection, and pruning. The algorithms are tested on a linear cluster tool to show their effectiveness. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|