Diagnosability of labeled $\mathfrak{D_p}$ automata
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2021
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911777097252864 |
|---|---|
| author | Zhang, Kuize Raisch, Joerg |
| author_facet | Zhang, Kuize Raisch, Joerg |
| contents | In this paper, we formulate a notion of diagnosability for labeled weighted automata over a class of dioids which admit both positive and negative numbers as well as vectors. The weights can represent diverse physical meanings such as time elapsing and position deviations. We also develop an original tool called concurrent composition to verify diagnosability for such automata. These results are fundamentally new compared with the existing ones in the literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_07125 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Diagnosability of labeled $\mathfrak{D_p}$ automata Zhang, Kuize Raisch, Joerg Formal Languages and Automata Theory In this paper, we formulate a notion of diagnosability for labeled weighted automata over a class of dioids which admit both positive and negative numbers as well as vectors. The weights can represent diverse physical meanings such as time elapsing and position deviations. We also develop an original tool called concurrent composition to verify diagnosability for such automata. These results are fundamentally new compared with the existing ones in the literature. |
| title | Diagnosability of labeled $\mathfrak{D_p}$ automata |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2109.07125 |