Sciweavers

5 search results - page 1 / 1
» The Complexity of Epistemic Model Checking: Clock Semantics ...
Sort
View
ECAI
2010
Springer
13 years 6 months ago
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time
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...
Xiaowei Huang, Ron van der Meyden
ATAL
2005
Springer
13 years 10 months ago
Bounded model checking knowledge and branching time in synchronous multi-agent systems
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...
Xiangyu Luo, Kaile Su, Abdul Sattar, Qingliang Che...
AUSAI
2009
Springer
13 years 11 months ago
Model Checking Games for a Fair Branching-Time Temporal Epistemic Logic
Model checking games are instances of Hintikka’s game semantics for logic used for purposes of debugging systems verification models. Previous work in the area has developed the...
Xiaowei Huang, Ron van der Meyden
ICFEM
2004
Springer
13 years 10 months ago
Timed Patterns: TCOZ to Timed Automata
Abstract. The integrated logic-based modeling language, Timed Communicating Object Z (TCOZ), is well suited for presenting complete and coherent requirement models for complex real...
Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun 00...
FORMATS
2006
Springer
13 years 8 months ago
Adding Invariants to Event Zone Automata
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
Peter Niebert, Hongyang Qu