Learn More
Partial order techniques enable reducing the size of the state graph used for model checking, thus alleviating thèstate space explosion' problem. These reductions are based on selecting a subset of the enabled operations from each program state. So far, these methods have been studied, implemented and demonstrated for assertional languages that model the(More)
We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be applied to the "attacking generals problem", a typical example of oordination in multi-agent systems.
Bounded Model Checking (BMC) has been recently introduced as an efficient verification method for reactive systems. BMC based on SAT methods consists in searching for a counterexample of a particular length and generating a propositional formula that is satisfiable iff such a counterexample exists. This new technique has been introduced by E. Clarke et al.(More)
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK 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(More)
Temporal logic of causal knowledge over general partially ordered structures is deened. The deenition of knowledge captures the change of state due to action executions. The structures are a variant of ow event structures including prime event structures and branching processes of Petri Nets. Modalities corresponding to the causality, independency, and(More)