Relational Version of the Multi-agent Computation Tree Logic $\mathcal{CTLK}$
This paper deals with multi-agent computation tree logic --- $\mathcal{CTLK}$ (Computation Tree Logic with Knowledge). Each agent represents its own computational route of the initial problem, and new branches of possible computational routes spawn new agents. The logic $\mathcal{CTLK}$ is a natural...
| Prif Awduron: | , |
|---|---|
| Fformat: | Erthygl |
| Iaith: | English |
| Cyhoeddwyd: |
Irkutsk State University
2024-03-01
|
| Cyfres: | Известия Иркутского государственного университета: Серия "Математика" |
| Pynciau: | |
| Mynediad Ar-lein: | https://mathizv.isu.ru/en/article/file?id=1481 |