… verifying temporal and epistemic properties of multi-agent systems by means of bounded
model checking. … application of bounded model checking to verifying not just temporal, but also …

… (ie knowledge) and measurable properties in multi-agent systems, we propose a new logic
… In order to verify properties expressed with PCTLK, we put forward the model checking …

… bounded model checking (BMC) approach to the verification of temporal epistemic properties
of multi-agent systems. … incorporating epistemic modalities and obtain a temporal epistemic …

… for checking multi-agent systems against temporal-epistemic specifications, in … The behaviors
that comply with temporalepistemic … Similar to the bounded model checking approaches pre…

… applied for verifying knowledge in classical MAS, no methods for verifying knowledge in
probabilistic MAS yet exist. This paper proposes such a model checking approach for …

… By so doing, we are able to convert the PCTLK model checking … of verifying probabilistic
properties and epistemic properties … bounded model checking and unbounded model checking. …

… the verification of temporal epistemic properties in synchronous multi-agent systems (MAS)
via bounded model checking … Based on the semantics of synchronous interpreted system, we …

… model checking procedure to check the compliance of target systems against some desirable
properties … In our case, suppose A addresses probabilistic epistemic properties of agents …

… epistemic logic and a weak variant of the logic ATL interpreted on a three-valued semantics.
We show that the model checking problem for multi-agent systems … bounded model checking…

… We conclude by formulating the model checking problem for OMAS. Since we wish to account
for possibly infinite domains of objects and agents we import some basic terminology from …