Relational Version of the Multi-agent Computation Tree Logic $\mathcal{CTLK}$
Autor: | S. I. Bashmakov, K. A. Smelykh |
---|---|
Jazyk: | English<br />Russian |
Rok vydání: | 2024 |
Předmět: | |
Zdroj: | Известия Иркутского государственного университета: Серия "Математика", Vol 47, Iss 1, Pp 78-92 (2024) |
Druh dokumentu: | article |
ISSN: | 1997-7670 2541-8785 |
DOI: | 10.26516/1997-7670.2024.47.78 |
Popis: | 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 enrichment of $\mathcal{CTL}$ by new knowledge operators. We introduce alternative to automata Kripke's relational semantics, describes properties of $\mathcal{CTLK}^{Rel}$-frame and proves finite approximability. |
Databáze: | Directory of Open Access Journals |
Externí odkaz: |