309 search results - page 2 / 62 » Model Checking Games for Branching Time Logics |
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The pa...
ATVA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
DC
1998
13 years 5 months ago
1998
ATAL
2005
Springer
13 years 10 months ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We investigate the problem of the verification of multiagent systems by means of parallel algorithms. We present algorithms for CTLK, a logic combining branching time tem...