Name
Abstract | ||
|---|---|---|
Control of modular and distributed discrete-event systems appears as an approach to handle computational complexity of synthesizing supervisory controllers for large scale systems. For both modular and distributed discrete-event systems sufficient and necessary conditions are derived for modular control synthesis to equal global control synthesis for the supremal controllable sublanguage, for the supremal normal sublanguage, and for the supremal controllalble and normal sublanguage. The modular control synthesis has a much lower computational complexity than the corresponding global control synthesis for the respective sublanguages. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11804192_3 | FMCO |
Keywords | Field | DocType |
normal sublanguage,corresponding global control synthesis,supremal controllalble,lower computational complexity,discrete-event system,supremal normal sublanguage,global control synthesis,modular control synthesis,computational complexity,supremal controllable sublanguage | Object-oriented programming,Computer science,Supervisory control,Algorithm,Theoretical computer science,Component-based software engineering,Modular design,Formal methods,Software development,Distributed computing,Computational complexity theory,Sublanguage | Conference |
Volume | ISSN | ISBN |
4111 | 0302-9743 | 3-540-36749-7 |
Citations | PageRank | References |
1 | 0.40 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Komenda | 1 | 147 | 21.85 |
| Jan H. van Schuppen | 2 | 358 | 45.36 |