Defining the speed independence of the Boolean asynchronous systems
A discrete time Boolean asynchronous system consists in a function Φ : {0, 1}n → {0, 1}n which iterates its coordinates Φ1, ..., Φn independently of each other. The durations of computation of Φ1, ..., Φn are supposed to be unknown. The analysis of such systems has as main challenge characterizing t...
| Үндсэн зохиолч: | |
|---|---|
| Формат: | Өгүүллэг |
| Хэл сонгох: | English |
| Хэвлэсэн: |
EDP Sciences
2022-01-01
|
| Цуврал: | ITM Web of Conferences |
| Онлайн хандалт: | https://www.itm-conferences.org/articles/itmconf/pdf/2022/09/itmconf_icamnm2022_02008.pdf |