Polynomial Time Verification of Modular Diagnosability of Discrete Event Systems
| Autor: | Armand Toguyeni, Ben Li, Manel Khlif-Bouassida, João Carlos Basilio |
|---|---|
| Přispěvatelé: | PRES Université Lille Nord de France |
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
0209 industrial biotechnology Polynomial Theoretical computer science Event (computing) Computer science business.industry Observable 02 engineering and technology Modular design Deadlock Automaton 020901 industrial engineering & automation Control and Systems Engineering [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing business Time complexity ComputingMilieux_MISCELLANEOUS |
| Zdroj: | The 20th World Congress of the International Federation of Automatic Control, IFAC 2017 World Congress The 20th World Congress of the International Federation of Automatic Control, IFAC 2017 World Congress, Jul 2017, Toulouse, France. pp.13618-13623, ⟨10.1016/j.ifacol.2017.08.2387⟩ |
| DOI: | 10.1016/j.ifacol.2017.08.2387⟩ |
| Popis: | This paper addresses the modular diagnosability verification of discrete event system (DES). We assume that the language generated by each automaton module can have deadlocks and that the common events among modules are observable. A new algorithm is developed based on the proposition of a necessary and sufficient condition for modular diagnosability, whose complexity is polynomial and is lower than that of other approaches in literature. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|