|
| << vorige |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 31 van 31 gevonden artikelen
| Titel: |
Update and Abstraction in Model Checking of Knowledge and Branching Time |
| Auteur: |
Shilov, N.V. Garanina, N.O. Choe, K.-M. |
| Verschenen in: |
Fundamenta informaticae |
| Paginering: | Jaargang 72 (2006) nr. 1-3 pagina's 347-361 |
| Jaar: |
2006-08-08 |
| Inhoud: |
We present (update+abstraction) algorithm for model checking a fusion of Computation Tree Logic and Propositional Logic of Knowledge in systems with the perfect recall synchronous semantics. It has been already known that the problem is decidable with a non-elementary lower bound. The decidability follows from interpretation of the problem in a so-called Chain Logic and then in the Second Order Logic of Monadic Successors. This time we give a direct algorithm for model checking and detailed time upper bound where a number of different parameters are taken into count (i.e. a number of agents, a number of states, knowledge depth, formula size). We present a toy experiment with this algorithm that encourages our hope that the algorithm can be used in practice. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 31 van 31 gevonden artikelen
| << vorige |