Name
Abstract | ||
|---|---|---|
The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to extend the common alphabet so that the language becomes conditionally decomposable. A relationship of conditional decomposability to nonblockingness of modular discrete-event systems in general settings is also discussed in this paper. It is shown that conditional decomposability is a weaker condition than nonblockingness. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.sysconle.2012.07.013 | Systems & Control Letters |
Keywords | DocType | Volume |
Discrete-event system,Coordination control,Conditional decomposability | Journal | 61 |
Issue | ISSN | Citations |
12 | 0167-6911 | 7 |
PageRank | References | Authors |
0.55 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Komenda | 1 | 147 | 21.85 |
| Tomás Masopust | 2 | 155 | 23.56 |
| Jan H. van Schuppen | 3 | 358 | 45.36 |