.png){kind=icon}
.png){kind=icon}
Return
Bounded model checking for knowledge and real time
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2007.05.005.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the TECTLK model checking problem is decidable, and we present an algorithm for bounded model checking based on a discretisation method. We exemplify the use of the technique by means of the Railroad Crossing System, a popular example in the multi-agent systems literature. (c) 2007 Elsevier B.V All rights reserved.
Keywords:
temporal epistemic logics
model checking
interpreted systems
real time systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
View more organizations