Zobrazeno 1 - 10
of 841
pro vyhledávání: '"automates"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
I. V. Bystrova, B. P. Podkopaev
Publikováno v:
Известия высших учебных заведений России: Радиоэлектроника, Vol 23, Iss 1, Pp 18-29 (2020)
Introduction. In the paper a fault isolation problem in the devices combining digital unit by functional diagnostics methods is considered. Networks of state automates are accepted as mathematical models of the devices. Assumed, that functional diagn
Externí odkaz:
https://doaj.org/article/593c46e8cd5849539f8bafa9ffb8191d
Autor:
I. V. Bystrova, B. P. Podkopaev
Publikováno v:
Известия высших учебных заведений России: Радиоэлектроника, Vol 0, Iss 2, Pp 12-19 (2018)
The problem of functional diagnosis of digital devices forming a network of state automata is considered. This task for the network components is supposed to be solved, and the corresponding diagnostic devices for them are provided. The possibility o
Externí odkaz:
https://doaj.org/article/949bf30d3cf644cab5d1785ddf5f8258
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ben Ramdhane, Firas
Publikováno v:
Mathematics [math]. Aix Marseille Université (AMU), Marseille, FRA.; University of Sfax, Tunisia, 2023. English. ⟨NNT : 2023AIXM0186⟩
In this thesis, we study symbolic dynamical systems on spaces defined from editdistances, in particular the spaces of Besicovitch and Weyl. These are metric spacesdefined using pseudo-metrics and quotients by the relation of pseudo-metric zero.For th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3430::b71858a5ace8a424a446e2507d90b371
https://hal.science/tel-04146898
https://hal.science/tel-04146898
Autor:
Hilaire, Mathieu
Publikováno v:
Computational Complexity [cs.CC]. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG095⟩
The most standard model checking approaches are limited to verifying concrete specifications, such as “can we reach a configuration with more than 10 time units elapsing ?”. Nethertheless, for certaincomputer programs, like embedded systems, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::770103ada399783ac3b3a9708bc0283e
https://theses.hal.science/tel-03964912
https://theses.hal.science/tel-03964912
Autor:
Suresh, Amrita
Publikováno v:
Logic in Computer Science [cs.LO]. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG092⟩
Distributed systems involve processes that run independently and communicate asynchronously. While they capture a wide range of use cases and are hence, ubiquitous in our world, it is also particularly difficult to ensure their correctness. In this t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::9e25474f929d452691e0c24f094f3e99
https://theses.hal.science/tel-04047037
https://theses.hal.science/tel-04047037
Autor:
Plenet, Théo
Publikováno v:
Automatic Control Engineering. Université de Perpignan, 2022. English. ⟨NNT : 2022PERP0031⟩
In this thesis, we propose to study the observability of cellular automata (CA), i.e. how we can efficiently reconstruct the state of a CA from a limited number of measurements. To do so, we draw our inspiration from the notion of observability in cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2191::c06d5fe2d9c7d71d055d0d73d3b66827
https://theses.hal.science/tel-04002482/file/These_Plenet_Theo_2022.pdf
https://theses.hal.science/tel-04002482/file/These_Plenet_Theo_2022.pdf
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Esnay, Solene
Publikováno v:
General Mathematics [math.GM]. Université Paul Sabatier-Toulouse III, 2022. English. ⟨NNT : 2022TOU30187⟩
Given a finite set of symbols and a list of rules specifying which of them can appear next to each other, one can build a -- possibly empty -- set of infinite lines of symbols in two directions obeying these rules, named configurations. A set of conf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4074::726d673fe9c1d97b331e3df8f420b216
https://theses.hal.science/tel-04008608
https://theses.hal.science/tel-04008608